./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_init4_ground-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_init4_ground-1.i -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 84dd450b83ffc0eda27ceeda48a4324978aec0ffc3f50cf64d7cfe4a88062bda --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:48:44,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:48:44,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:48:44,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:48:44,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:48:44,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:48:44,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:48:44,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:48:44,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:48:44,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:48:44,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:48:44,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:48:44,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:48:44,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:48:44,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:48:44,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:48:44,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:48:44,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:48:44,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:48:44,372 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 -> 84dd450b83ffc0eda27ceeda48a4324978aec0ffc3f50cf64d7cfe4a88062bda [2025-02-08 08:48:44,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:48:44,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:48:44,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:48:44,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:48:44,560 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:48:44,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init4_ground-1.i [2025-02-08 08:48:45,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/262437292/54a8edb764db49c68f7312001381cf4c/FLAG2bd72625b [2025-02-08 08:48:45,929 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:48:45,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init4_ground-1.i [2025-02-08 08:48:45,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/262437292/54a8edb764db49c68f7312001381cf4c/FLAG2bd72625b [2025-02-08 08:48:46,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/262437292/54a8edb764db49c68f7312001381cf4c [2025-02-08 08:48:46,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:48:46,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:48:46,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:48:46,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:48:46,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:48:46,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46, skipping insertion in model container [2025-02-08 08:48:46,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:48:46,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:48:46,389 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:48:46,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:48:46,414 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:48:46,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46 WrapperNode [2025-02-08 08:48:46,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:48:46,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:48:46,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:48:46,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:48:46,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,435 INFO L138 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-02-08 08:48:46,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:48:46,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:48:46,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:48:46,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:48:46,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,459 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-08 08:48:46,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:48:46,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:48:46,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:48:46,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:48:46,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (1/1) ... [2025-02-08 08:48:46,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:48:46,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:46,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:48:46,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:48:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:48:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:48:46,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:48:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:48:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:48:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:48:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:48:46,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:48:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:48:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:48:46,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:48:46,594 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:48:46,596 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:48:46,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-02-08 08:48:46,729 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-08 08:48:46,729 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:48:46,736 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:48:46,737 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:48:46,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:48:46 BoogieIcfgContainer [2025-02-08 08:48:46,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:48:46,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:48:46,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:48:46,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:48:46,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:48:46" (1/3) ... [2025-02-08 08:48:46,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c49e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:48:46, skipping insertion in model container [2025-02-08 08:48:46,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:46" (2/3) ... [2025-02-08 08:48:46,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c49e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:48:46, skipping insertion in model container [2025-02-08 08:48:46,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:48:46" (3/3) ... [2025-02-08 08:48:46,746 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_init4_ground-1.i [2025-02-08 08:48:46,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:48:46,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_init4_ground-1.i that has 1 procedures, 33 locations, 1 initial locations, 5 loop locations, and 10 error locations. [2025-02-08 08:48:46,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:48:46,808 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;@451c4f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:48:46,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 08:48:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 08:48:46,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:46,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 08:48:46,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash 68485, now seen corresponding path program 1 times [2025-02-08 08:48:46,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:46,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907594593] [2025-02-08 08:48:46,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:46,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:46,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:48:46,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:48:46,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:46,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:47,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907594593] [2025-02-08 08:48:47,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907594593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:47,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:47,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:48:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204079359] [2025-02-08 08:48:47,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:47,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:48:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:47,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:48:47,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:48:47,021 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:47,092 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2025-02-08 08:48:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:48:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-08 08:48:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:47,100 INFO L225 Difference]: With dead ends: 73 [2025-02-08 08:48:47,100 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 08:48:47,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:48:47,106 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:47,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:48:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 08:48:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 08:48:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-02-08 08:48:47,141 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 3 [2025-02-08 08:48:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:47,141 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-02-08 08:48:47,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-02-08 08:48:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 08:48:47,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:47,142 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 08:48:47,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:48:47,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:47,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2040240733, now seen corresponding path program 1 times [2025-02-08 08:48:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741278931] [2025-02-08 08:48:47,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:47,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:48:47,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:48:47,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:47,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:47,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741278931] [2025-02-08 08:48:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741278931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725606645] [2025-02-08 08:48:47,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:47,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:47,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:47,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:47,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:48:47,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:48:47,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:48:47,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:47,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:48:47,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:47,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:48:47,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725606645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:47,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:48:47,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 08:48:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616183482] [2025-02-08 08:48:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:47,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:48:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:47,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:48:47,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:48:47,346 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:47,463 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-02-08 08:48:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:48:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-08 08:48:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:47,469 INFO L225 Difference]: With dead ends: 40 [2025-02-08 08:48:47,469 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 08:48:47,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:48:47,470 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:47,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:48:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 08:48:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-08 08:48:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-02-08 08:48:47,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 6 [2025-02-08 08:48:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:47,481 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-02-08 08:48:47,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-02-08 08:48:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:48:47,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:47,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 08:48:47,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:48:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:47,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:47,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1177046713, now seen corresponding path program 1 times [2025-02-08 08:48:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541969851] [2025-02-08 08:48:47,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:47,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:48:47,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:48:47,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:47,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:47,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541969851] [2025-02-08 08:48:47,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541969851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:47,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:47,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:48:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317739355] [2025-02-08 08:48:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:47,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:48:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:47,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:48:47,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:48:47,761 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:47,818 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-02-08 08:48:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:48:47,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:48:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:47,820 INFO L225 Difference]: With dead ends: 36 [2025-02-08 08:48:47,820 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 08:48:47,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:48:47,821 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:47,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:48:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 08:48:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2025-02-08 08:48:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-08 08:48:47,829 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2025-02-08 08:48:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:47,830 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-08 08:48:47,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-08 08:48:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 08:48:47,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:47,833 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] [2025-02-08 08:48:47,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:48:47,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:47,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:47,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1368273864, now seen corresponding path program 1 times [2025-02-08 08:48:47,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474889345] [2025-02-08 08:48:47,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:47,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:48:47,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:48:47,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:47,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:48:47,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474889345] [2025-02-08 08:48:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474889345] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147134232] [2025-02-08 08:48:47,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:47,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:47,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:47,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:47,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:48:47,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:48:47,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:48:47,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:47,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:47,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:48:47,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:48:47,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:48:47,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147134232] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:47,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:47,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 08:48:47,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146119157] [2025-02-08 08:48:47,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:47,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:48:47,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:47,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:48:47,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:48:47,980 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:48,069 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2025-02-08 08:48:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:48:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 08:48:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:48,072 INFO L225 Difference]: With dead ends: 79 [2025-02-08 08:48:48,072 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 08:48:48,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:48:48,073 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:48,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 26 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:48:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 08:48:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 08:48:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.103448275862069) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-02-08 08:48:48,078 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2025-02-08 08:48:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:48,078 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-02-08 08:48:48,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-02-08 08:48:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 08:48:48,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:48,079 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:48,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:48:48,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:48,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:48,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash 789032824, now seen corresponding path program 2 times [2025-02-08 08:48:48,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:48,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88748663] [2025-02-08 08:48:48,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:48,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:48,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-08 08:48:48,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 57 statements. [2025-02-08 08:48:48,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:48:48,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-08 08:48:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88748663] [2025-02-08 08:48:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88748663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:48:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334572937] [2025-02-08 08:48:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:48,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:48:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:48,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:48:48,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:48,396 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:48,430 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2025-02-08 08:48:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:48:48,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-08 08:48:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:48,433 INFO L225 Difference]: With dead ends: 67 [2025-02-08 08:48:48,433 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 08:48:48,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:48,434 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:48,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 08:48:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 08:48:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-02-08 08:48:48,451 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 57 [2025-02-08 08:48:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:48,451 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-02-08 08:48:48,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-02-08 08:48:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 08:48:48,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:48,452 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:48,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:48:48,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:48,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2000859157, now seen corresponding path program 1 times [2025-02-08 08:48:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:48,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874243904] [2025-02-08 08:48:48,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:48,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 08:48:48,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 08:48:48,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:48,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-08 08:48:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874243904] [2025-02-08 08:48:48,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874243904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:48,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097090782] [2025-02-08 08:48:48,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:48,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:48,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:48,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:48:48,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 08:48:48,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 08:48:48,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:48,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:48,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:48:48,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-08 08:48:48,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-08 08:48:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097090782] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:48,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-08 08:48:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249477396] [2025-02-08 08:48:48,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:48,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:48:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:48,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:48:48,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:48:48,789 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:48,961 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2025-02-08 08:48:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:48:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-08 08:48:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:48,966 INFO L225 Difference]: With dead ends: 188 [2025-02-08 08:48:48,966 INFO L226 Difference]: Without dead ends: 137 [2025-02-08 08:48:48,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:48:48,967 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 142 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:48,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 40 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:48:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-08 08:48:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-08 08:48:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 136 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2025-02-08 08:48:48,979 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 62 [2025-02-08 08:48:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:48,979 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2025-02-08 08:48:48,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2025-02-08 08:48:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-08 08:48:48,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:48,984 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:48,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:48:49,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:49,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:49,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:49,186 INFO L85 PathProgramCache]: Analyzing trace with hash 637594603, now seen corresponding path program 2 times [2025-02-08 08:48:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387168149] [2025-02-08 08:48:49,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:49,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-02-08 08:48:49,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 08:48:49,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:48:49,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-02-08 08:48:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387168149] [2025-02-08 08:48:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387168149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866993589] [2025-02-08 08:48:49,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:49,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:49,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:49,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:49,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:48:49,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-02-08 08:48:49,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 08:48:49,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:48:49,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:49,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:48:49,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-02-08 08:48:49,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-02-08 08:48:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866993589] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:50,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 28 [2025-02-08 08:48:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113519219] [2025-02-08 08:48:50,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:50,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 08:48:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:50,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 08:48:50,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:48:50,177 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:50,610 INFO L93 Difference]: Finished difference Result 385 states and 441 transitions. [2025-02-08 08:48:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 08:48:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 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 134 [2025-02-08 08:48:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:50,613 INFO L225 Difference]: With dead ends: 385 [2025-02-08 08:48:50,614 INFO L226 Difference]: Without dead ends: 280 [2025-02-08 08:48:50,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:48:50,616 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 401 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:50,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 31 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 08:48:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-08 08:48:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-02-08 08:48:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.017921146953405) internal successors, (284), 279 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 284 transitions. [2025-02-08 08:48:50,630 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 284 transitions. Word has length 134 [2025-02-08 08:48:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:50,630 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 284 transitions. [2025-02-08 08:48:50,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 284 transitions. [2025-02-08 08:48:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-08 08:48:50,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:50,632 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:50,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:48:50,833 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,SelfDestructingSolverStorable6 [2025-02-08 08:48:50,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:48:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 334649691, now seen corresponding path program 1 times [2025-02-08 08:48:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272742818] [2025-02-08 08:48:50,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:50,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-08 08:48:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-08 08:48:50,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2865 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2861 trivial. 0 not checked. [2025-02-08 08:48:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:51,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272742818] [2025-02-08 08:48:51,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272742818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:51,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:51,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:48:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258425833] [2025-02-08 08:48:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:51,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:48:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:51,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:48:51,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:51,101 INFO L87 Difference]: Start difference. First operand 280 states and 284 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-08 08:48:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:51,115 INFO L93 Difference]: Finished difference Result 280 states and 284 transitions. [2025-02-08 08:48:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:48:51,116 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 279 [2025-02-08 08:48:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:51,117 INFO L225 Difference]: With dead ends: 280 [2025-02-08 08:48:51,117 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:48:51,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:51,118 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:51,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:48:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:48:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:48:51,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 279 [2025-02-08 08:48:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:51,119 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:48:51,119 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-08 08:48:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:48:51,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:48:51,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-02-08 08:48:51,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-08 08:48:51,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-08 08:48:51,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-08 08:48:51,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-08 08:48:51,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-08 08:48:51,124 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-08 08:48:51,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-08 08:48:51,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-08 08:48:51,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-02-08 08:48:51,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:48:51,128 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-02-08 08:48:51,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:48:51,186 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:48:51,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:48:51 BoogieIcfgContainer [2025-02-08 08:48:51,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:48:51,198 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:48:51,198 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:48:51,198 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:48:51,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:48:46" (3/4) ... [2025-02-08 08:48:51,200 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:48:51,208 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 08:48:51,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:48:51,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:48:51,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:48:51,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:48:51,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:48:51,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:48:51,275 INFO L158 Benchmark]: Toolchain (without parser) took 5015.47ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 64.0MB in the end (delta: 48.7MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2025-02-08 08:48:51,276 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:48:51,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.88ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:48:51,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.50ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:48:51,277 INFO L158 Benchmark]: Boogie Preprocessor took 33.83ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 901.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:48:51,277 INFO L158 Benchmark]: IcfgBuilder took 266.54ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 86.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:48:51,278 INFO L158 Benchmark]: TraceAbstraction took 4457.02ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 70.0MB in the end (delta: 16.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-02-08 08:48:51,278 INFO L158 Benchmark]: Witness Printer took 76.06ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 64.0MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:48:51,279 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.88ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 101.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.50ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.83ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 901.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 266.54ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 86.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4457.02ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 70.0MB in the end (delta: 16.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Witness Printer took 76.06ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 64.0MB in the end (delta: 6.0MB). 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: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: 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, 33 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 622 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 622 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 699 IncrementalHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 113 mSDtfsCounter, 699 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=7, InterpolantAutomatonStates: 64, 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, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 792 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 994 ConstructedInterpolants, 0 QuantifiedInterpolants, 1282 SizeOfPredicates, 0 NumberOfNonLiveVariables, 776 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 4635/5000 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 10 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 17]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:48:51,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE