./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/pr3.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 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:19:08,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:19:09,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:19:09,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:19:09,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:19:09,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:19:09,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:19:09,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:19:09,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:19:09,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:19:09,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:19:09,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:19:09,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:19:09,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:19:09,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:19:09,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:19:09,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:19:09,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:19:09,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:19:09,033 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 -> 73efddcda095c52d9900d13088d1ec70520de6007541f46343a568e878cf2ed4 [2025-02-06 13:19:09,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:19:09,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:19:09,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:19:09,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:19:09,198 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:19:09,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr3.c [2025-02-06 13:19:10,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09e9c5f89/bdfeefda861841fb9dbc9a1903dcaaae/FLAG8e860bdc2 [2025-02-06 13:19:10,591 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:19:10,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/pr3.c [2025-02-06 13:19:10,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09e9c5f89/bdfeefda861841fb9dbc9a1903dcaaae/FLAG8e860bdc2 [2025-02-06 13:19:10,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09e9c5f89/bdfeefda861841fb9dbc9a1903dcaaae [2025-02-06 13:19:10,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:19:10,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:19:10,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:19:10,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:19:10,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:19:10,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:19:10" (1/1) ... [2025-02-06 13:19:10,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219a0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:10, skipping insertion in model container [2025-02-06 13:19:10,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:19:10" (1/1) ... [2025-02-06 13:19:10,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:19:11,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:19:11,066 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:19:11,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:19:11,095 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:19:11,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11 WrapperNode [2025-02-06 13:19:11,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:19:11,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:19:11,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:19:11,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:19:11,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,124 INFO L138 Inliner]: procedures = 15, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2025-02-06 13:19:11,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:19:11,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:19:11,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:19:11,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:19:11,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,155 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 6, 8]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-02-06 13:19:11,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:19:11,166 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:19:11,166 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:19:11,166 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:19:11,167 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (1/1) ... [2025-02-06 13:19:11,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:19:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:11,188 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-06 13:19:11,192 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-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:19:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:19:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:19:11,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:19:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:19:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:19:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:19:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:19:11,248 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:19:11,249 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:19:11,400 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-02-06 13:19:11,400 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:19:11,407 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:19:11,407 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:19:11,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:19:11 BoogieIcfgContainer [2025-02-06 13:19:11,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:19:11,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:19:11,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:19:11,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:19:11,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:19:10" (1/3) ... [2025-02-06 13:19:11,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f0654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:19:11, skipping insertion in model container [2025-02-06 13:19:11,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:19:11" (2/3) ... [2025-02-06 13:19:11,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f0654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:19:11, skipping insertion in model container [2025-02-06 13:19:11,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:19:11" (3/3) ... [2025-02-06 13:19:11,414 INFO L128 eAbstractionObserver]: Analyzing ICFG pr3.c [2025-02-06 13:19:11,424 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:19:11,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr3.c that has 1 procedures, 84 locations, 1 initial locations, 2 loop locations, and 30 error locations. [2025-02-06 13:19:11,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:19:11,481 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;@c5c15f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:19:11,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-06 13:19:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 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-06 13:19:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:19:11,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:11,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:11,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:11,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:11,493 INFO L85 PathProgramCache]: Analyzing trace with hash -837761731, now seen corresponding path program 1 times [2025-02-06 13:19:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271897383] [2025-02-06 13:19:11,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:11,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:19:11,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:19:11,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:11,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:11,623 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-06 13:19:11,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271897383] [2025-02-06 13:19:11,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271897383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:11,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:11,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:19:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907914566] [2025-02-06 13:19:11,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:11,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 13:19:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:11,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 13:19:11,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 13:19:11,645 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:11,660 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2025-02-06 13:19:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 13:19:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:19:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:11,667 INFO L225 Difference]: With dead ends: 162 [2025-02-06 13:19:11,667 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 13:19:11,669 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-06 13:19:11,672 INFO L435 NwaCegarLoop]: 90 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, 90 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-06 13:19:11,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 13:19:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 13:19:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 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-06 13:19:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2025-02-06 13:19:11,704 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 8 [2025-02-06 13:19:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:11,704 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2025-02-06 13:19:11,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2025-02-06 13:19:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:19:11,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:11,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:11,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:19:11,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:11,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -837731940, now seen corresponding path program 1 times [2025-02-06 13:19:11,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:11,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003097139] [2025-02-06 13:19:11,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:11,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:19:11,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:19:11,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:11,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:11,920 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-06 13:19:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003097139] [2025-02-06 13:19:11,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003097139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:11,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:11,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:11,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602329236] [2025-02-06 13:19:11,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:11,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:11,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:11,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:11,922 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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-06 13:19:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:11,957 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-02-06 13:19:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:11,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-06 13:19:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:11,960 INFO L225 Difference]: With dead ends: 78 [2025-02-06 13:19:11,960 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 13:19:11,960 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-06 13:19:11,960 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 75 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-06 13:19:11,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 75 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 13:19:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 13:19:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 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-06 13:19:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-02-06 13:19:11,969 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 8 [2025-02-06 13:19:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:11,969 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-02-06 13:19:11,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-06 13:19:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-02-06 13:19:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:19:11,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:11,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:11,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:19:11,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:11,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -199886315, now seen corresponding path program 1 times [2025-02-06 13:19:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:11,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781892095] [2025-02-06 13:19:11,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:11,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:11,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:19:11,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:19:11,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:11,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:12,156 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-06 13:19:12,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:12,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781892095] [2025-02-06 13:19:12,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781892095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:12,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:12,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:19:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234417583] [2025-02-06 13:19:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:12,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:19:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:12,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:19:12,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:19:12,158 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:12,179 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-02-06 13:19:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:19:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 13:19:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:12,180 INFO L225 Difference]: With dead ends: 77 [2025-02-06 13:19:12,180 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 13:19:12,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-06 13:19:12,181 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:12,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 74 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 13:19:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 13:19:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.6875) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 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-06 13:19:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2025-02-06 13:19:12,185 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 9 [2025-02-06 13:19:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:12,185 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2025-02-06 13:19:12,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2025-02-06 13:19:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 13:19:12,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:12,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:12,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:19:12,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:12,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1988491312, now seen corresponding path program 1 times [2025-02-06 13:19:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:12,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759337775] [2025-02-06 13:19:12,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:12,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:19:12,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:19:12,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:12,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:12,258 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-06 13:19:12,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759337775] [2025-02-06 13:19:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759337775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:12,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:12,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:19:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40506659] [2025-02-06 13:19:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:12,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:19:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:12,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:19:12,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:19:12,259 INFO L87 Difference]: Start difference. First operand 76 states and 81 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-06 13:19:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:12,398 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-02-06 13:19:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:19:12,398 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-06 13:19:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:12,399 INFO L225 Difference]: With dead ends: 132 [2025-02-06 13:19:12,399 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 13:19:12,399 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-06 13:19:12,399 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:12,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 13:19:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-02-06 13:19:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 106 states have internal predecessors, (116), 0 states have call successors, (0), 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-06 13:19:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-02-06 13:19:12,405 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 12 [2025-02-06 13:19:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:12,405 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-02-06 13:19:12,405 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-06 13:19:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-02-06 13:19:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:19:12,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:12,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:12,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:19:12,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:12,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:12,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1093457101, now seen corresponding path program 1 times [2025-02-06 13:19:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940037713] [2025-02-06 13:19:12,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:12,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:12,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:19:12,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:19:12,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:12,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:12,478 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-06 13:19:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:12,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940037713] [2025-02-06 13:19:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940037713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860633148] [2025-02-06 13:19:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:12,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:12,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:12,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:12,479 INFO L87 Difference]: Start difference. First operand 107 states and 116 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-06 13:19:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:12,548 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2025-02-06 13:19:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:12,549 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-06 13:19:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:12,550 INFO L225 Difference]: With dead ends: 116 [2025-02-06 13:19:12,550 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 13:19:12,550 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-06 13:19:12,551 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:12,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 169 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 13:19:12,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 13:19:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 0 states have call successors, (0), 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-06 13:19:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2025-02-06 13:19:12,556 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 17 [2025-02-06 13:19:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:12,556 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2025-02-06 13:19:12,556 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-06 13:19:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2025-02-06 13:19:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:19:12,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:12,557 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-06 13:19:12,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:19:12,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:12,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1979510930, now seen corresponding path program 1 times [2025-02-06 13:19:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244240317] [2025-02-06 13:19:12,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:12,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:19:12,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:19:12,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:12,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:12,730 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-06 13:19:12,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244240317] [2025-02-06 13:19:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244240317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:12,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:12,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:19:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400013404] [2025-02-06 13:19:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:12,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:19:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:12,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:19:12,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:19:12,732 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-06 13:19:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:12,832 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-02-06 13:19:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:19:12,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-06 13:19:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:12,834 INFO L225 Difference]: With dead ends: 132 [2025-02-06 13:19:12,835 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 13:19:12,835 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-06 13:19:12,836 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 245 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:12,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 67 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 13:19:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-02-06 13:19:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.430232558139535) internal successors, (123), 113 states have internal predecessors, (123), 0 states have call successors, (0), 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-06 13:19:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-02-06 13:19:12,842 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 24 [2025-02-06 13:19:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:12,842 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-02-06 13:19:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-06 13:19:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-02-06 13:19:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:19:12,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:12,843 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:12,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:19:12,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 644763067, now seen corresponding path program 1 times [2025-02-06 13:19:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859325292] [2025-02-06 13:19:12,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:12,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:19:12,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:19:12,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:12,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:12,912 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-06 13:19:12,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:12,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859325292] [2025-02-06 13:19:12,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859325292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:12,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:12,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995935039] [2025-02-06 13:19:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:12,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:12,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:12,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:12,913 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:12,995 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2025-02-06 13:19:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 13:19:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:12,997 INFO L225 Difference]: With dead ends: 119 [2025-02-06 13:19:12,997 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 13:19:12,997 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-06 13:19:12,998 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:12,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 13:19:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-06 13:19:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 116 states have internal predecessors, (126), 0 states have call successors, (0), 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-06 13:19:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2025-02-06 13:19:13,002 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 27 [2025-02-06 13:19:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:13,003 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2025-02-06 13:19:13,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2025-02-06 13:19:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 13:19:13,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:13,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:13,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:19:13,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -531065173, now seen corresponding path program 1 times [2025-02-06 13:19:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707748106] [2025-02-06 13:19:13,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:13,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:19:13,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:19:13,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:13,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:13,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707748106] [2025-02-06 13:19:13,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707748106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:13,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097377118] [2025-02-06 13:19:13,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:13,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:13,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:13,060 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-06 13:19:13,061 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-06 13:19:13,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 13:19:13,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 13:19:13,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:13,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:13,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:13,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:13,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097377118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:13,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:13,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:19:13,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962157306] [2025-02-06 13:19:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:19:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:13,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:19:13,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:19:13,171 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:13,287 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2025-02-06 13:19:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:19:13,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 13:19:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:13,292 INFO L225 Difference]: With dead ends: 117 [2025-02-06 13:19:13,292 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 13:19:13,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-06 13:19:13,292 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:13,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 87 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 13:19:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-06 13:19:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 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-06 13:19:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2025-02-06 13:19:13,300 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2025-02-06 13:19:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:13,300 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2025-02-06 13:19:13,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2025-02-06 13:19:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 13:19:13,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:13,301 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:13,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:19:13,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:13,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:13,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:13,502 INFO L85 PathProgramCache]: Analyzing trace with hash 716848854, now seen corresponding path program 1 times [2025-02-06 13:19:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388444561] [2025-02-06 13:19:13,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:13,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:19:13,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:19:13,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:13,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388444561] [2025-02-06 13:19:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388444561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982184979] [2025-02-06 13:19:13,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:13,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:13,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:13,591 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-06 13:19:13,600 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-06 13:19:13,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 13:19:13,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 13:19:13,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:13,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:13,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:13,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:19:13,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982184979] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:13,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:13,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:19:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746102661] [2025-02-06 13:19:13,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:13,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:19:13,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:13,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:19:13,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:19:13,754 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 10 states, 9 states have (on average 9.777777777777779) internal successors, (88), 10 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-06 13:19:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:13,897 INFO L93 Difference]: Finished difference Result 150 states and 177 transitions. [2025-02-06 13:19:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:19:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.777777777777779) internal successors, (88), 10 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) Word has length 35 [2025-02-06 13:19:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:13,900 INFO L225 Difference]: With dead ends: 150 [2025-02-06 13:19:13,900 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 13:19:13,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 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-06 13:19:13,901 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 91 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:13,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 122 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 13:19:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 13:19:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 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-06 13:19:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2025-02-06 13:19:13,917 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 35 [2025-02-06 13:19:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:13,917 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2025-02-06 13:19:13,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.777777777777779) internal successors, (88), 10 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-06 13:19:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2025-02-06 13:19:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 13:19:13,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:13,918 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:13,925 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-06 13:19:14,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:14,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:14,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash 999501257, now seen corresponding path program 1 times [2025-02-06 13:19:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172804073] [2025-02-06 13:19:14,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:14,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:19:14,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:19:14,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172804073] [2025-02-06 13:19:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172804073] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135449316] [2025-02-06 13:19:14,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:14,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:14,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:14,205 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-06 13:19:14,207 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-06 13:19:14,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:19:14,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:19:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:14,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:19:14,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:14,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:19:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135449316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:14,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:19:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:19:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188260177] [2025-02-06 13:19:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:14,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:19:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:14,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:19:14,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:19:14,283 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:14,365 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2025-02-06 13:19:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:19:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 13:19:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:14,366 INFO L225 Difference]: With dead ends: 137 [2025-02-06 13:19:14,366 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 13:19:14,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 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-06 13:19:14,367 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:14,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 13:19:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-06 13:19:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.143939393939394) internal successors, (151), 135 states have internal predecessors, (151), 0 states have call successors, (0), 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-06 13:19:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2025-02-06 13:19:14,370 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 46 [2025-02-06 13:19:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:14,370 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2025-02-06 13:19:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:19:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2025-02-06 13:19:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 13:19:14,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:14,371 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:14,376 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-06 13:19:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:14,573 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:14,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash 919767869, now seen corresponding path program 1 times [2025-02-06 13:19:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610948613] [2025-02-06 13:19:14,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:14,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:19:14,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:19:14,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:14,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610948613] [2025-02-06 13:19:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610948613] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513487638] [2025-02-06 13:19:14,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:14,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:14,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:14,684 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-06 13:19:14,688 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-06 13:19:14,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 13:19:14,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 13:19:14,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:14,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:14,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:19:14,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:14,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:19:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513487638] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:14,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:14,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:19:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262855719] [2025-02-06 13:19:14,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:14,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:19:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:14,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:19:14,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:19:14,876 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 13:19:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:14,989 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2025-02-06 13:19:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:19:14,990 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 13:19:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:14,991 INFO L225 Difference]: With dead ends: 158 [2025-02-06 13:19:14,991 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 13:19:14,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:19:14,991 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:14,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 134 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 13:19:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-06 13:19:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 153 states have (on average 1.1437908496732025) internal successors, (175), 156 states have internal predecessors, (175), 0 states have call successors, (0), 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-06 13:19:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2025-02-06 13:19:14,996 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 47 [2025-02-06 13:19:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:14,996 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2025-02-06 13:19:14,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 13:19:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2025-02-06 13:19:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 13:19:14,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:14,997 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:15,003 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-06 13:19:15,197 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,SelfDestructingSolverStorable10 [2025-02-06 13:19:15,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:15,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1050909714, now seen corresponding path program 2 times [2025-02-06 13:19:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373331364] [2025-02-06 13:19:15,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:15,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 13:19:15,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 68 statements. [2025-02-06 13:19:15,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:15,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:15,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373331364] [2025-02-06 13:19:15,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373331364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:15,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760345135] [2025-02-06 13:19:15,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:15,267 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-06 13:19:15,268 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-06 13:19:15,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 13:19:15,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 68 statements. [2025-02-06 13:19:15,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:15,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:15,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:15,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:15,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 13:19:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760345135] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:15,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:15,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-06 13:19:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378726507] [2025-02-06 13:19:15,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:15,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:19:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:15,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:19:15,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:19:15,516 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 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-06 13:19:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:15,599 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2025-02-06 13:19:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:19:15,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 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 68 [2025-02-06 13:19:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:15,600 INFO L225 Difference]: With dead ends: 157 [2025-02-06 13:19:15,600 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 13:19:15,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 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-06 13:19:15,600 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:15,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 40 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:19:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 13:19:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 13:19:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 117 states have (on average 1.1111111111111112) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 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-06 13:19:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-02-06 13:19:15,605 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 68 [2025-02-06 13:19:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:15,605 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-02-06 13:19:15,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 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-06 13:19:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-02-06 13:19:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 13:19:15,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:15,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:15,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:19:15,806 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,SelfDestructingSolverStorable11 [2025-02-06 13:19:15,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2047243535, now seen corresponding path program 1 times [2025-02-06 13:19:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180302683] [2025-02-06 13:19:15,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:19:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:15,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 13:19:15,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 13:19:15,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:19:15,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 13:19:15,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:15,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180302683] [2025-02-06 13:19:15,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180302683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:19:15,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:19:15,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:19:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138807216] [2025-02-06 13:19:15,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:19:15,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:19:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:15,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:19:15,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:19:15,868 INFO L87 Difference]: Start difference. First operand 120 states and 130 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-06 13:19:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:15,908 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2025-02-06 13:19:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:19:15,909 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 72 [2025-02-06 13:19:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:15,910 INFO L225 Difference]: With dead ends: 120 [2025-02-06 13:19:15,910 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 13:19:15,910 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-06 13:19:15,910 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:15,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 13:19:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 13:19:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.1025641025641026) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 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-06 13:19:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2025-02-06 13:19:15,913 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 72 [2025-02-06 13:19:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:15,913 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2025-02-06 13:19:15,913 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-06 13:19:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2025-02-06 13:19:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 13:19:15,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:19:15,915 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:15,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:19:15,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:19:15,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:19:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1603829088, now seen corresponding path program 2 times [2025-02-06 13:19:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:19:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105980953] [2025-02-06 13:19:15,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:19:15,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-02-06 13:19:15,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 79 statements. [2025-02-06 13:19:15,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:15,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-06 13:19:16,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:19:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105980953] [2025-02-06 13:19:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105980953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:19:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140951246] [2025-02-06 13:19:16,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:19:16,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:19:16,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:19:16,027 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-06 13:19:16,028 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-06 13:19:16,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-02-06 13:19:16,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 79 statements. [2025-02-06 13:19:16,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:19:16,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:19:16,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:19:16,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:19:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-06 13:19:16,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:19:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-06 13:19:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140951246] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:19:16,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:19:16,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 9 [2025-02-06 13:19:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589465019] [2025-02-06 13:19:16,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:19:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:19:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:19:16,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:19:16,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:19:16,481 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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-06 13:19:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:19:16,531 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2025-02-06 13:19:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:19:16,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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-06 13:19:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:19:16,532 INFO L225 Difference]: With dead ends: 119 [2025-02-06 13:19:16,532 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:19:16,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:19:16,533 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 106 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:19:16,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 17 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:19:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:19:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:19:16,533 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-06 13:19:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:19:16,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-02-06 13:19:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:19:16,533 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:19:16,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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-06 13:19:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:19:16,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:19:16,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2025-02-06 13:19:16,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2025-02-06 13:19:16,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2025-02-06 13:19:16,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2025-02-06 13:19:16,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2025-02-06 13:19:16,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2025-02-06 13:19:16,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2025-02-06 13:19:16,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2025-02-06 13:19:16,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2025-02-06 13:19:16,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2025-02-06 13:19:16,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:19:16,737 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,SelfDestructingSolverStorable13 [2025-02-06 13:19:16,739 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:19:16,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:19:16,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:19:16,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:19:16 BoogieIcfgContainer [2025-02-06 13:19:16,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:19:16,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:19:16,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:19:16,822 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:19:16,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:19:11" (3/4) ... [2025-02-06 13:19:16,823 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:19:16,830 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 13:19:16,830 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 13:19:16,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:19:16,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:19:16,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:19:16,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:19:16,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:19:16,885 INFO L158 Benchmark]: Toolchain (without parser) took 5944.83ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 60.4MB in the end (delta: 62.5MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2025-02-06 13:19:16,885 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:16,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.73ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:16,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.51ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:19:16,885 INFO L158 Benchmark]: Boogie Preprocessor took 37.92ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:16,885 INFO L158 Benchmark]: IcfgBuilder took 241.62ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 91.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:19:16,885 INFO L158 Benchmark]: TraceAbstraction took 5411.95ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 68.4MB in the end (delta: 22.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2025-02-06 13:19:16,885 INFO L158 Benchmark]: Witness Printer took 62.33ms. Allocated memory is still 167.8MB. Free memory was 68.4MB in the beginning and 60.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:19:16,886 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.16ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.73ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.51ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.92ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 241.62ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 91.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5411.95ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 68.4MB in the end (delta: 22.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 62.33ms. Allocated memory is still 167.8MB. Free memory was 68.4MB in the beginning and 60.4MB in the end (delta: 8.1MB). 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: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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, 84 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1065 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1065 mSDsluCounter, 1200 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 565 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1323 IncrementalHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 635 mSDtfsCounter, 1323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 525 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=11, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 795 NumberOfCodeBlocks, 563 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 3666 SizeOfPredicates, 4 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 485/641 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 30 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) || ((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647))) - InvariantResult [Line: 58]: Location Invariant Derived location invariant: (((((1 <= i) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) || ((((i == 0) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:19:16,897 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