./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 7f9c3cc28dda067824ba301477f1c03bcac7a80158bb9362e7546f3bd18e0377 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 15:53:28,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 15:53:28,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 15:53:28,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 15:53:28,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 15:53:28,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 15:53:28,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 15:53:28,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 15:53:28,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 15:53:28,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 15:53:28,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 15:53:28,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 15:53:28,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 15:53:28,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 15:53:28,132 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 15:53:28,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 15:53:28,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 15:53:28,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 15:53:28,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 15:53:28,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 15:53:28,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 15:53:28,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 15:53:28,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 15:53:28,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 15:53:28,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 15:53:28,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 15:53:28,135 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f9c3cc28dda067824ba301477f1c03bcac7a80158bb9362e7546f3bd18e0377 [2025-02-06 15:53:28,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 15:53:28,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 15:53:28,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 15:53:28,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 15:53:28,437 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 15:53:28,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i [2025-02-06 15:53:29,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73bbcf7c5/073948362bf241c295b59e31f22f2167/FLAG878cb1205 [2025-02-06 15:53:29,990 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 15:53:29,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i [2025-02-06 15:53:30,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73bbcf7c5/073948362bf241c295b59e31f22f2167/FLAG878cb1205 [2025-02-06 15:53:30,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73bbcf7c5/073948362bf241c295b59e31f22f2167 [2025-02-06 15:53:30,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 15:53:30,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 15:53:30,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 15:53:30,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 15:53:30,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 15:53:30,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0e4973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30, skipping insertion in model container [2025-02-06 15:53:30,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 15:53:30,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 15:53:30,797 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 15:53:30,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 15:53:30,929 INFO L204 MainTranslator]: Completed translation [2025-02-06 15:53:30,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30 WrapperNode [2025-02-06 15:53:30,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 15:53:30,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 15:53:30,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 15:53:30,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 15:53:30,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,977 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2025-02-06 15:53:30,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 15:53:30,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 15:53:30,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 15:53:30,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 15:53:30,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,997 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 15:53:30,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:30,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:31,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:31,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:31,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:31,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:31,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 15:53:31,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 15:53:31,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 15:53:31,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 15:53:31,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (1/1) ... [2025-02-06 15:53:31,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 15:53:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:53:31,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 15:53:31,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 15:53:31,075 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 15:53:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 15:53:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 15:53:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 15:53:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 15:53:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 15:53:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 15:53:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2025-02-06 15:53:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2025-02-06 15:53:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2025-02-06 15:53:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2025-02-06 15:53:31,184 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 15:53:31,185 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 15:53:31,319 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-06 15:53:31,319 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 15:53:31,332 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 15:53:31,332 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 15:53:31,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:53:31 BoogieIcfgContainer [2025-02-06 15:53:31,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 15:53:31,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 15:53:31,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 15:53:31,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 15:53:31,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:53:30" (1/3) ... [2025-02-06 15:53:31,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68282967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:53:31, skipping insertion in model container [2025-02-06 15:53:31,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:53:30" (2/3) ... [2025-02-06 15:53:31,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68282967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:53:31, skipping insertion in model container [2025-02-06 15:53:31,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:53:31" (3/3) ... [2025-02-06 15:53:31,339 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i [2025-02-06 15:53:31,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 15:53:31,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_multiply_08_good.i that has 5 procedures, 85 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 15:53:31,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 15:53:31,420 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;@32b4023e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 15:53:31,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 15:53:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 66 states have internal predecessors, (77), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 15:53:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 15:53:31,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:31,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:31,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:31,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 573373272, now seen corresponding path program 1 times [2025-02-06 15:53:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:31,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665570821] [2025-02-06 15:53:31,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:31,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:31,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 15:53:31,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 15:53:31,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:31,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 15:53:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665570821] [2025-02-06 15:53:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665570821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:31,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:53:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:53:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688224571] [2025-02-06 15:53:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:31,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:31,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:31,614 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 66 states have internal predecessors, (77), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 15:53:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:31,641 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2025-02-06 15:53:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:31,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-02-06 15:53:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:31,647 INFO L225 Difference]: With dead ends: 85 [2025-02-06 15:53:31,647 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 15:53:31,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:31,650 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:31,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 209 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 15:53:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 15:53:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 58 states have internal predecessors, (67), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 15:53:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2025-02-06 15:53:31,674 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 23 [2025-02-06 15:53:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:31,674 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-02-06 15:53:31,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 15:53:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2025-02-06 15:53:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 15:53:31,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:31,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 15:53:31,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 594702291, now seen corresponding path program 1 times [2025-02-06 15:53:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946635007] [2025-02-06 15:53:31,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:31,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 15:53:31,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 15:53:31,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:31,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 15:53:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:31,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946635007] [2025-02-06 15:53:31,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946635007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:31,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:53:31,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:53:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985338531] [2025-02-06 15:53:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:31,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:31,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:31,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:31,753 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 15:53:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:31,775 INFO L93 Difference]: Finished difference Result 139 states and 183 transitions. [2025-02-06 15:53:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:31,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-02-06 15:53:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:31,777 INFO L225 Difference]: With dead ends: 139 [2025-02-06 15:53:31,777 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 15:53:31,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:31,778 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:31,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 183 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 15:53:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-06 15:53:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 61 states have internal predecessors, (72), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 15:53:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2025-02-06 15:53:31,786 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 24 [2025-02-06 15:53:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:31,786 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2025-02-06 15:53:31,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 15:53:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2025-02-06 15:53:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 15:53:31,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:31,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:31,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 15:53:31,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:31,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1677733523, now seen corresponding path program 1 times [2025-02-06 15:53:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:31,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669352230] [2025-02-06 15:53:31,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:31,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 15:53:31,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 15:53:31,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:31,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 15:53:31,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:31,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669352230] [2025-02-06 15:53:31,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669352230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:31,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:53:31,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:53:31,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909169359] [2025-02-06 15:53:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:31,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:31,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:31,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:31,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:31,873 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 15:53:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:31,891 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2025-02-06 15:53:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:31,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2025-02-06 15:53:31,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:31,892 INFO L225 Difference]: With dead ends: 79 [2025-02-06 15:53:31,892 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 15:53:31,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:31,893 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:31,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 179 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 15:53:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 15:53:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 60 states have internal predecessors, (71), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 15:53:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2025-02-06 15:53:31,900 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 37 [2025-02-06 15:53:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:31,901 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2025-02-06 15:53:31,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 15:53:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2025-02-06 15:53:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 15:53:31,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:31,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:31,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 15:53:31,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash 470131682, now seen corresponding path program 1 times [2025-02-06 15:53:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181122176] [2025-02-06 15:53:31,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:31,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 15:53:31,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 15:53:31,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:31,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 15:53:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181122176] [2025-02-06 15:53:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181122176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:53:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:53:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231256559] [2025-02-06 15:53:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:31,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:31,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:31,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:31,992 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 15:53:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:32,014 INFO L93 Difference]: Finished difference Result 125 states and 163 transitions. [2025-02-06 15:53:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2025-02-06 15:53:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:32,016 INFO L225 Difference]: With dead ends: 125 [2025-02-06 15:53:32,016 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 15:53:32,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:53:32,017 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:32,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 15:53:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-02-06 15:53:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 63 states have internal predecessors, (76), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 15:53:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-02-06 15:53:32,026 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 38 [2025-02-06 15:53:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:32,027 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-02-06 15:53:32,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 15:53:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-02-06 15:53:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 15:53:32,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:32,028 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:32,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 15:53:32,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:32,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 357449062, now seen corresponding path program 1 times [2025-02-06 15:53:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125184086] [2025-02-06 15:53:32,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:32,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:32,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 15:53:32,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 15:53:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 15:53:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125184086] [2025-02-06 15:53:32,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125184086] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 15:53:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143904589] [2025-02-06 15:53:32,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:32,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:32,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:53:32,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 15:53:32,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 15:53:32,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 15:53:32,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 15:53:32,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:32,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:32,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 15:53:32,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 15:53:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 15:53:32,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 15:53:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143904589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 15:53:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 15:53:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575958475] [2025-02-06 15:53:32,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:32,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:32,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:32,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:32,294 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 15:53:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:32,322 INFO L93 Difference]: Finished difference Result 105 states and 140 transitions. [2025-02-06 15:53:32,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:32,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2025-02-06 15:53:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:32,324 INFO L225 Difference]: With dead ends: 105 [2025-02-06 15:53:32,324 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 15:53:32,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:32,324 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:32,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 15:53:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-02-06 15:53:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.35) internal successors, (81), 66 states have internal predecessors, (81), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 15:53:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-02-06 15:53:32,344 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 49 [2025-02-06 15:53:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:32,344 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-02-06 15:53:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 15:53:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-02-06 15:53:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 15:53:32,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:32,345 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:32,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 15:53:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:32,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:32,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1803980963, now seen corresponding path program 1 times [2025-02-06 15:53:32,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:32,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968840140] [2025-02-06 15:53:32,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:32,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:32,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 15:53:32,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 15:53:32,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:32,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 15:53:32,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968840140] [2025-02-06 15:53:32,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968840140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 15:53:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203600801] [2025-02-06 15:53:32,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:32,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:53:32,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 15:53:32,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 15:53:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 15:53:32,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 15:53:32,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:32,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:32,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 15:53:32,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 15:53:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 15:53:32,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 15:53:32,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203600801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:32,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 15:53:32,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 15:53:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534515941] [2025-02-06 15:53:32,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:32,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:32,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:32,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:32,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:32,696 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 15:53:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:32,716 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2025-02-06 15:53:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:32,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-02-06 15:53:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:32,718 INFO L225 Difference]: With dead ends: 88 [2025-02-06 15:53:32,719 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 15:53:32,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:32,720 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:32,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 15:53:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-02-06 15:53:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 65 states have internal predecessors, (80), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 15:53:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-02-06 15:53:32,725 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 50 [2025-02-06 15:53:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:32,726 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-02-06 15:53:32,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 15:53:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-02-06 15:53:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 15:53:32,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:32,727 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:32,733 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-06 15:53:32,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:32,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:32,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1304372041, now seen corresponding path program 1 times [2025-02-06 15:53:32,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:32,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459227841] [2025-02-06 15:53:32,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:32,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 15:53:32,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 15:53:32,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:32,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 15:53:33,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459227841] [2025-02-06 15:53:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459227841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 15:53:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025013859] [2025-02-06 15:53:33,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:33,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:33,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:53:33,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 15:53:33,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 15:53:33,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 15:53:33,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 15:53:33,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:33,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:33,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 15:53:33,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 15:53:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 15:53:33,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 15:53:33,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025013859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 15:53:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 15:53:33,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856014163] [2025-02-06 15:53:33,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:33,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:33,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:33,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:33,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:33,157 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 15:53:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:33,175 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2025-02-06 15:53:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2025-02-06 15:53:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:33,176 INFO L225 Difference]: With dead ends: 108 [2025-02-06 15:53:33,177 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 15:53:33,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:33,179 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:33,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 15:53:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-02-06 15:53:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 15:53:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2025-02-06 15:53:33,188 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 54 [2025-02-06 15:53:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:33,189 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2025-02-06 15:53:33,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 15:53:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2025-02-06 15:53:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 15:53:33,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:33,193 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:33,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 15:53:33,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:33,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:33,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1093030895, now seen corresponding path program 1 times [2025-02-06 15:53:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940279853] [2025-02-06 15:53:33,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:33,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 15:53:33,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 15:53:33,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:33,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 15:53:33,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940279853] [2025-02-06 15:53:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940279853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 15:53:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972127654] [2025-02-06 15:53:33,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:33,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:33,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:53:33,471 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 15:53:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 15:53:33,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 15:53:33,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 15:53:33,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:33,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:33,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 15:53:33,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 15:53:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 15:53:33,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 15:53:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972127654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:33,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 15:53:33,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 15:53:33,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734905304] [2025-02-06 15:53:33,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:33,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:33,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:33,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:33,556 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 15:53:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:33,566 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2025-02-06 15:53:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:33,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-02-06 15:53:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:33,567 INFO L225 Difference]: With dead ends: 91 [2025-02-06 15:53:33,567 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 15:53:33,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:33,568 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:33,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 185 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 15:53:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-02-06 15:53:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 67 states have internal predecessors, (81), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 15:53:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-02-06 15:53:33,574 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 62 [2025-02-06 15:53:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:33,574 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-02-06 15:53:33,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 15:53:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-02-06 15:53:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 15:53:33,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:33,580 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:33,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 15:53:33,781 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,SelfDestructingSolverStorable7 [2025-02-06 15:53:33,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:33,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1394481938, now seen corresponding path program 1 times [2025-02-06 15:53:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:33,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686859827] [2025-02-06 15:53:33,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:33,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 15:53:33,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 15:53:33,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:33,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 15:53:33,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686859827] [2025-02-06 15:53:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686859827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 15:53:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455888538] [2025-02-06 15:53:33,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:33,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:33,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:53:33,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 15:53:33,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 15:53:33,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 15:53:33,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 15:53:33,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:33,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:33,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 15:53:33,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 15:53:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 15:53:33,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 15:53:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455888538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 15:53:33,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 15:53:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427413136] [2025-02-06 15:53:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:33,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:33,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:33,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:33,927 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 15:53:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:33,935 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2025-02-06 15:53:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:33,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-02-06 15:53:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:33,937 INFO L225 Difference]: With dead ends: 91 [2025-02-06 15:53:33,937 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 15:53:33,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:33,938 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:33,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 15:53:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 15:53:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.271186440677966) internal successors, (75), 62 states have internal predecessors, (75), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 15:53:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-02-06 15:53:33,944 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 62 [2025-02-06 15:53:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:33,944 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-02-06 15:53:33,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 15:53:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-02-06 15:53:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 15:53:33,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:53:33,949 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:33,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 15:53:34,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:34,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:53:34,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:53:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash 475780609, now seen corresponding path program 1 times [2025-02-06 15:53:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:53:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997384494] [2025-02-06 15:53:34,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:53:34,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 15:53:34,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 15:53:34,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:34,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 15:53:34,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:53:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997384494] [2025-02-06 15:53:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997384494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 15:53:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407197252] [2025-02-06 15:53:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:53:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 15:53:34,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:53:34,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 15:53:34,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 15:53:34,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 15:53:34,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 15:53:34,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:53:34,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:53:34,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 15:53:34,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 15:53:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 15:53:34,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 15:53:34,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407197252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:53:34,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 15:53:34,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 15:53:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668135393] [2025-02-06 15:53:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:53:34,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:53:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:53:34,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:53:34,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:34,291 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 15:53:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:53:34,297 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2025-02-06 15:53:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:53:34,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2025-02-06 15:53:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:53:34,298 INFO L225 Difference]: With dead ends: 83 [2025-02-06 15:53:34,298 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 15:53:34,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 15:53:34,299 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:53:34,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:53:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 15:53:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 15:53:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 15:53:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 15:53:34,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2025-02-06 15:53:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:53:34,300 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 15:53:34,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 15:53:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 15:53:34,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 15:53:34,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 15:53:34,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 15:53:34,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 15:53:34,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 15:53:34,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 15:53:34,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 15:53:34,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 15:53:34,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 15:53:34,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 15:53:34,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 15:53:34,507 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:53:34,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 15:53:34,540 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 15:53:34,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:53:34 BoogieIcfgContainer [2025-02-06 15:53:34,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 15:53:34,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 15:53:34,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 15:53:34,544 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 15:53:34,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:53:31" (3/4) ... [2025-02-06 15:53:34,546 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 15:53:34,550 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 15:53:34,550 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2025-02-06 15:53:34,550 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 15:53:34,550 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2025-02-06 15:53:34,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 15:53:34,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 15:53:34,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 15:53:34,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 15:53:34,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 15:53:34,608 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 15:53:34,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 15:53:34,608 INFO L158 Benchmark]: Toolchain (without parser) took 4412.02ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.3MB in the beginning and 237.0MB in the end (delta: -133.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2025-02-06 15:53:34,608 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:53:34,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.15ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 41.2MB in the end (delta: 61.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 15:53:34,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.66ms. Allocated memory is still 142.6MB. Free memory was 41.2MB in the beginning and 37.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:53:34,609 INFO L158 Benchmark]: Boogie Preprocessor took 25.83ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 36.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:53:34,609 INFO L158 Benchmark]: IcfgBuilder took 328.13ms. Allocated memory is still 142.6MB. Free memory was 36.3MB in the beginning and 90.9MB in the end (delta: -54.5MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-02-06 15:53:34,609 INFO L158 Benchmark]: TraceAbstraction took 3209.71ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 90.1MB in the beginning and 244.0MB in the end (delta: -153.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2025-02-06 15:53:34,610 INFO L158 Benchmark]: Witness Printer took 63.63ms. Allocated memory is still 310.4MB. Free memory was 244.0MB in the beginning and 237.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 15:53:34,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.15ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 41.2MB in the end (delta: 61.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.66ms. Allocated memory is still 142.6MB. Free memory was 41.2MB in the beginning and 37.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.83ms. Allocated memory is still 142.6MB. Free memory was 37.9MB in the beginning and 36.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 328.13ms. Allocated memory is still 142.6MB. Free memory was 36.3MB in the beginning and 90.9MB in the end (delta: -54.5MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3209.71ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 90.1MB in the beginning and 244.0MB in the end (delta: -153.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 63.63ms. Allocated memory is still 310.4MB. Free memory was 244.0MB in the beginning and 237.0MB in the end (delta: 7.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: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1641]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: 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 5 procedures, 85 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 1826 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 867 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 959 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=8, InterpolantAutomatonStates: 30, 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, 10 MinimizatonAttempts, 8 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1064 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 416/440 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 15:53:34,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE