./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Addition02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Addition02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12b38fa2e3d5fdbfa2e75fd7db8c6635c3a88ba468adc8c100051dd60d30a551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:57:59,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:57:59,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:57:59,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:57:59,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:57:59,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:57:59,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:57:59,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:57:59,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:57:59,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:57:59,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:57:59,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:57:59,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:57:59,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:57:59,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:57:59,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:57:59,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:57:59,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:57:59,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:57:59,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:57:59,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:57:59,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:57:59,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:57:59,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:57:59,153 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12b38fa2e3d5fdbfa2e75fd7db8c6635c3a88ba468adc8c100051dd60d30a551 [2025-02-08 09:57:59,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:57:59,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:57:59,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:57:59,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:57:59,352 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:57:59,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Addition02.c [2025-02-08 09:58:00,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bda7e8337/461941ca0c2242fda8cab5d5b04a2d39/FLAGf637fd795 [2025-02-08 09:58:00,686 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:58:00,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Addition02.c [2025-02-08 09:58:00,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bda7e8337/461941ca0c2242fda8cab5d5b04a2d39/FLAGf637fd795 [2025-02-08 09:58:01,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bda7e8337/461941ca0c2242fda8cab5d5b04a2d39 [2025-02-08 09:58:01,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:58:01,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:58:01,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:58:01,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:58:01,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:58:01,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cf4d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01, skipping insertion in model container [2025-02-08 09:58:01,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:58:01,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:58:01,193 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:58:01,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:58:01,215 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:58:01,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01 WrapperNode [2025-02-08 09:58:01,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:58:01,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:58:01,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:58:01,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:58:01,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,239 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2025-02-08 09:58:01,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:58:01,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:58:01,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:58:01,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:58:01,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,258 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 09:58:01,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:58:01,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:58:01,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:58:01,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:58:01,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (1/1) ... [2025-02-08 09:58:01,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:58:01,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:58:01,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:58:01,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:58:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:58:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:58:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:58:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:58:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2025-02-08 09:58:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2025-02-08 09:58:01,390 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:58:01,392 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:58:01,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5; [2025-02-08 09:58:01,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret4; [2025-02-08 09:58:01,491 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-08 09:58:01,491 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:58:01,497 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:58:01,497 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:58:01,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:58:01 BoogieIcfgContainer [2025-02-08 09:58:01,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:58:01,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:58:01,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:58:01,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:58:01,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:58:01" (1/3) ... [2025-02-08 09:58:01,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b65c302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:58:01, skipping insertion in model container [2025-02-08 09:58:01,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:58:01" (2/3) ... [2025-02-08 09:58:01,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b65c302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:58:01, skipping insertion in model container [2025-02-08 09:58:01,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:58:01" (3/3) ... [2025-02-08 09:58:01,504 INFO L128 eAbstractionObserver]: Analyzing ICFG Addition02.c [2025-02-08 09:58:01,514 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:58:01,515 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Addition02.c that has 2 procedures, 39 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-02-08 09:58:01,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:58:01,552 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;@1bf28c8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:58:01,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 09:58:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 09:58:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:58:01,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:01,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:01,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:01,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash 457153764, now seen corresponding path program 1 times [2025-02-08 09:58:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3484452] [2025-02-08 09:58:01,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:01,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:58:01,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:58:01,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:01,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3484452] [2025-02-08 09:58:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3484452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:58:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764686872] [2025-02-08 09:58:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:01,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:58:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:01,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:58:01,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:58:01,754 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:01,868 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2025-02-08 09:58:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:58:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 09:58:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:01,875 INFO L225 Difference]: With dead ends: 68 [2025-02-08 09:58:01,875 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 09:58:01,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:58:01,880 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 46 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:01,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 108 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:58:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 09:58:01,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2025-02-08 09:58:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 45 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:58:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-02-08 09:58:01,912 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 8 [2025-02-08 09:58:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:01,913 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-02-08 09:58:01,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-02-08 09:58:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 09:58:01,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:01,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:01,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:58:01,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:01,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:01,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1286864807, now seen corresponding path program 1 times [2025-02-08 09:58:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:01,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65398961] [2025-02-08 09:58:01,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:01,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:01,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 09:58:01,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 09:58:01,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:01,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:01,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65398961] [2025-02-08 09:58:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65398961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:01,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:01,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:58:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521136154] [2025-02-08 09:58:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:01,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:58:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:01,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:58:01,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:58:01,972 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:02,030 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-02-08 09:58:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:58:02,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 09:58:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:02,031 INFO L225 Difference]: With dead ends: 101 [2025-02-08 09:58:02,032 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 09:58:02,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:58:02,032 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:02,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 102 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:58:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 09:58:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-02-08 09:58:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 75 states have internal predecessors, (103), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:58:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-02-08 09:58:02,041 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 9 [2025-02-08 09:58:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:02,041 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-02-08 09:58:02,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-02-08 09:58:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:58:02,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:02,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:58:02,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting additionErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1238103362, now seen corresponding path program 1 times [2025-02-08 09:58:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461658095] [2025-02-08 09:58:02,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:02,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:58:02,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:58:02,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:02,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:02,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461658095] [2025-02-08 09:58:02,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461658095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:02,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:02,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:58:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537173426] [2025-02-08 09:58:02,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:58:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:58:02,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:58:02,079 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:02,101 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2025-02-08 09:58:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:58:02,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 09:58:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:02,102 INFO L225 Difference]: With dead ends: 97 [2025-02-08 09:58:02,102 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 09:58:02,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:58:02,103 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:02,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:58:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 09:58:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2025-02-08 09:58:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.5) internal successors, (99), 74 states have internal predecessors, (99), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:58:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2025-02-08 09:58:02,113 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 10 [2025-02-08 09:58:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:02,113 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2025-02-08 09:58:02,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2025-02-08 09:58:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:58:02,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:02,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:02,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:58:02,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:02,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1237336421, now seen corresponding path program 1 times [2025-02-08 09:58:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:02,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103575451] [2025-02-08 09:58:02,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:02,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:58:02,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:58:02,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:02,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103575451] [2025-02-08 09:58:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103575451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:02,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:02,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:58:02,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175113798] [2025-02-08 09:58:02,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:02,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:58:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:02,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:58:02,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:58:02,169 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:58:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:02,190 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2025-02-08 09:58:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:58:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-02-08 09:58:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:02,191 INFO L225 Difference]: With dead ends: 88 [2025-02-08 09:58:02,192 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 09:58:02,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:58:02,195 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:02,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:58:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 09:58:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 09:58:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 73 states have internal predecessors, (98), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:58:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2025-02-08 09:58:02,211 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 10 [2025-02-08 09:58:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:02,211 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2025-02-08 09:58:02,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:58:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2025-02-08 09:58:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 09:58:02,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:02,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:02,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:58:02,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting additionErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:02,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash -273501435, now seen corresponding path program 1 times [2025-02-08 09:58:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043730259] [2025-02-08 09:58:02,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:58:02,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:58:02,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:02,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:02,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043730259] [2025-02-08 09:58:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043730259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:02,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:58:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669105539] [2025-02-08 09:58:02,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:02,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:58:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:02,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:58:02,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:58:02,267 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:02,327 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2025-02-08 09:58:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:58:02,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 09:58:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:02,329 INFO L225 Difference]: With dead ends: 99 [2025-02-08 09:58:02,329 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 09:58:02,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:58:02,330 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:02,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 78 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:58:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 09:58:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-02-08 09:58:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.393939393939394) internal successors, (92), 72 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 09:58:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2025-02-08 09:58:02,338 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 11 [2025-02-08 09:58:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2025-02-08 09:58:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2025-02-08 09:58:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 09:58:02,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:02,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:58:02,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:02,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash -272916538, now seen corresponding path program 1 times [2025-02-08 09:58:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:02,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861276851] [2025-02-08 09:58:02,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:02,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:58:02,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:58:02,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:02,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:02,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861276851] [2025-02-08 09:58:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861276851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:02,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:02,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:58:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162855988] [2025-02-08 09:58:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:58:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:02,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:58:02,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:58:02,372 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:02,420 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2025-02-08 09:58:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:58:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 09:58:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:02,421 INFO L225 Difference]: With dead ends: 122 [2025-02-08 09:58:02,422 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 09:58:02,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:58:02,422 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:02,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 92 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:58:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 09:58:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2025-02-08 09:58:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 52 states have internal predecessors, (63), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 09:58:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2025-02-08 09:58:02,428 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 11 [2025-02-08 09:58:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:02,428 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2025-02-08 09:58:02,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2025-02-08 09:58:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 09:58:02,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:02,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:58:02,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:02,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash -297276638, now seen corresponding path program 1 times [2025-02-08 09:58:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:02,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320229618] [2025-02-08 09:58:02,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:02,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:58:02,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:58:02,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:02,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320229618] [2025-02-08 09:58:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320229618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:02,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:58:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666776735] [2025-02-08 09:58:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:02,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:58:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:02,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:58:02,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:58:02,462 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:58:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:02,475 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2025-02-08 09:58:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:58:02,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 09:58:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:02,476 INFO L225 Difference]: With dead ends: 62 [2025-02-08 09:58:02,476 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 09:58:02,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:58:02,477 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:02,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:58:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 09:58:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2025-02-08 09:58:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-02-08 09:58:02,480 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2025-02-08 09:58:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:02,481 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-02-08 09:58:02,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 09:58:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-02-08 09:58:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 09:58:02,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:02,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:02,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:58:02,481 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:02,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash 299690490, now seen corresponding path program 1 times [2025-02-08 09:58:02,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221903551] [2025-02-08 09:58:02,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:58:02,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:58:02,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:02,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221903551] [2025-02-08 09:58:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221903551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:58:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131767569] [2025-02-08 09:58:02,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:02,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:58:02,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:58:02,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:58:02,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:58:02,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:58:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:02,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:58:02,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:58:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:58:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131767569] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:58:02,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:58:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-08 09:58:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172391656] [2025-02-08 09:58:02,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:58:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:58:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:02,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:58:02,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:58:02,686 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:02,791 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2025-02-08 09:58:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 09:58:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 09:58:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:02,792 INFO L225 Difference]: With dead ends: 146 [2025-02-08 09:58:02,792 INFO L226 Difference]: Without dead ends: 144 [2025-02-08 09:58:02,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 09:58:02,793 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 126 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:02,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:58:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-08 09:58:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2025-02-08 09:58:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3) internal successors, (117), 97 states have internal predecessors, (117), 12 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-02-08 09:58:02,799 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 17 [2025-02-08 09:58:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:02,799 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-02-08 09:58:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2025-02-08 09:58:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 09:58:02,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:02,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:58:02,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:58:03,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:03,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash 240337241, now seen corresponding path program 1 times [2025-02-08 09:58:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:03,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664834342] [2025-02-08 09:58:03,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:58:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:03,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 09:58:03,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 09:58:03,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:58:03,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664834342] [2025-02-08 09:58:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664834342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:58:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:58:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:58:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229722291] [2025-02-08 09:58:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:58:03,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:58:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:03,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:58:03,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:58:03,049 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:03,072 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2025-02-08 09:58:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:58:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-08 09:58:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:03,073 INFO L225 Difference]: With dead ends: 109 [2025-02-08 09:58:03,073 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 09:58:03,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:58:03,073 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:03,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:58:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 09:58:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 09:58:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2025-02-08 09:58:03,079 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 19 [2025-02-08 09:58:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:03,079 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2025-02-08 09:58:03,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2025-02-08 09:58:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 09:58:03,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:03,080 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 09:58:03,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 09:58:03,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:03,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2131203827, now seen corresponding path program 2 times [2025-02-08 09:58:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646934970] [2025-02-08 09:58:03,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:58:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:03,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 09:58:03,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 09:58:03,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:58:03,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646934970] [2025-02-08 09:58:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646934970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:58:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73338099] [2025-02-08 09:58:03,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:58:03,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:03,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:58:03,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:58:03,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:58:03,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 09:58:03,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 09:58:03,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:58:03,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:03,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 09:58:03,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:58:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:03,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:58:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:03,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73338099] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:58:03,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:58:03,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-08 09:58:03,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541489372] [2025-02-08 09:58:03,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:58:03,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 09:58:03,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:03,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 09:58:03,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:58:03,576 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 14 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:03,751 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-02-08 09:58:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 09:58:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 14 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-08 09:58:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:03,752 INFO L225 Difference]: With dead ends: 94 [2025-02-08 09:58:03,753 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 09:58:03,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 09:58:03,754 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 127 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:03,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 128 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:58:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 09:58:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-02-08 09:58:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2025-02-08 09:58:03,763 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 41 [2025-02-08 09:58:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:03,764 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2025-02-08 09:58:03,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 14 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2025-02-08 09:58:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-08 09:58:03,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:03,768 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-02-08 09:58:03,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 09:58:03,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:03,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:03,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1180868581, now seen corresponding path program 3 times [2025-02-08 09:58:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:03,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558569624] [2025-02-08 09:58:03,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:58:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:03,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 11 equivalence classes. [2025-02-08 09:58:04,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 09:58:04,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:58:04,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558569624] [2025-02-08 09:58:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558569624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:58:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471084512] [2025-02-08 09:58:04,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:58:04,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:58:04,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:58:04,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:58:04,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 11 equivalence classes. [2025-02-08 09:58:04,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 09:58:04,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:58:04,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:04,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 09:58:04,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:58:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:04,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:58:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471084512] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:58:05,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:58:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-08 09:58:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214294139] [2025-02-08 09:58:05,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:58:05,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 09:58:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:05,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 09:58:05,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 09:58:05,205 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand has 48 states, 47 states have (on average 3.297872340425532) internal successors, (155), 26 states have internal predecessors, (155), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:05,695 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2025-02-08 09:58:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 09:58:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.297872340425532) internal successors, (155), 26 states have internal predecessors, (155), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-08 09:58:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:05,696 INFO L225 Difference]: With dead ends: 190 [2025-02-08 09:58:05,696 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 09:58:05,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-02-08 09:58:05,700 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 449 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:05,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 234 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:58:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 09:58:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2025-02-08 09:58:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.0061728395061729) internal successors, (163), 162 states have internal predecessors, (163), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2025-02-08 09:58:05,711 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 89 [2025-02-08 09:58:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2025-02-08 09:58:05,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.297872340425532) internal successors, (155), 26 states have internal predecessors, (155), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2025-02-08 09:58:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 09:58:05,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:05,718 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2025-02-08 09:58:05,725 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-08 09:58:05,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:05,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:05,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1060409911, now seen corresponding path program 4 times [2025-02-08 09:58:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591922389] [2025-02-08 09:58:05,921 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:58:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:05,933 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 185 statements into 2 equivalence classes. [2025-02-08 09:58:05,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 09:58:05,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:58:05,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591922389] [2025-02-08 09:58:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591922389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:58:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722876092] [2025-02-08 09:58:07,857 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:58:07,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:07,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:58:07,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:58:07,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:58:07,893 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 185 statements into 2 equivalence classes. [2025-02-08 09:58:07,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 09:58:07,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:58:07,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:07,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 09:58:07,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:58:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:08,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:58:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722876092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:58:09,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:58:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-02-08 09:58:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283583530] [2025-02-08 09:58:09,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:58:09,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-08 09:58:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:09,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-08 09:58:09,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 09:58:09,686 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand has 96 states, 95 states have (on average 3.4) internal successors, (323), 50 states have internal predecessors, (323), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:11,213 INFO L93 Difference]: Finished difference Result 382 states and 405 transitions. [2025-02-08 09:58:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-08 09:58:11,213 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 3.4) internal successors, (323), 50 states have internal predecessors, (323), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2025-02-08 09:58:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:11,214 INFO L225 Difference]: With dead ends: 382 [2025-02-08 09:58:11,215 INFO L226 Difference]: Without dead ends: 381 [2025-02-08 09:58:11,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-02-08 09:58:11,219 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 960 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:11,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 430 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:58:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-08 09:58:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 378. [2025-02-08 09:58:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 330 states have (on average 1.003030303030303) internal successors, (331), 330 states have internal predecessors, (331), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2025-02-08 09:58:11,231 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 185 [2025-02-08 09:58:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2025-02-08 09:58:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 3.4) internal successors, (323), 50 states have internal predecessors, (323), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2025-02-08 09:58:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-08 09:58:11,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:11,235 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2025-02-08 09:58:11,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 09:58:11,440 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,SelfDestructingSolverStorable11 [2025-02-08 09:58:11,440 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:11,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash -918029935, now seen corresponding path program 5 times [2025-02-08 09:58:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835173754] [2025-02-08 09:58:11,441 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:58:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:11,454 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 377 statements into 47 equivalence classes. [2025-02-08 09:58:11,564 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 377 of 377 statements. [2025-02-08 09:58:11,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 09:58:11,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:15,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:15,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835173754] [2025-02-08 09:58:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835173754] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:58:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650280601] [2025-02-08 09:58:15,665 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:58:15,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:15,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:58:15,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:58:15,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 09:58:15,700 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 377 statements into 47 equivalence classes. [2025-02-08 09:58:15,806 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 377 of 377 statements. [2025-02-08 09:58:15,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 09:58:15,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-08 09:58:15,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:58:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:16,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:58:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650280601] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:58:21,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:58:21,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-02-08 09:58:21,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303492389] [2025-02-08 09:58:21,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:58:21,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-02-08 09:58:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:58:21,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-02-08 09:58:21,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-02-08 09:58:21,762 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand has 192 states, 191 states have (on average 3.450261780104712) internal successors, (659), 98 states have internal predecessors, (659), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:58:28,302 INFO L93 Difference]: Finished difference Result 766 states and 813 transitions. [2025-02-08 09:58:28,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-08 09:58:28,303 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 3.450261780104712) internal successors, (659), 98 states have internal predecessors, (659), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2025-02-08 09:58:28,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:58:28,306 INFO L225 Difference]: With dead ends: 766 [2025-02-08 09:58:28,306 INFO L226 Difference]: Without dead ends: 765 [2025-02-08 09:58:28,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-02-08 09:58:28,311 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3508 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3508 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:58:28,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3508 Valid, 814 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:58:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-02-08 09:58:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 762. [2025-02-08 09:58:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 666 states have (on average 1.0015015015015014) internal successors, (667), 666 states have internal predecessors, (667), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 762 transitions. [2025-02-08 09:58:28,331 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 762 transitions. Word has length 377 [2025-02-08 09:58:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:58:28,332 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 762 transitions. [2025-02-08 09:58:28,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 3.450261780104712) internal successors, (659), 98 states have internal predecessors, (659), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:58:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 762 transitions. [2025-02-08 09:58:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2025-02-08 09:58:28,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:58:28,342 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 94, 1, 1, 1, 1, 1] [2025-02-08 09:58:28,350 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-08 09:58:28,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 09:58:28,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:58:28,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:58:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash -806563551, now seen corresponding path program 6 times [2025-02-08 09:58:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:58:28,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083197005] [2025-02-08 09:58:28,547 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:58:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:58:28,567 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 761 statements into 95 equivalence classes. [2025-02-08 09:58:28,777 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 761 of 761 statements. [2025-02-08 09:58:28,777 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 09:58:28,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:58:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083197005] [2025-02-08 09:58:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083197005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:58:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202515635] [2025-02-08 09:58:44,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:58:44,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:58:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:58:44,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:58:44,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 09:58:44,480 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 761 statements into 95 equivalence classes. [2025-02-08 09:58:44,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 761 of 761 statements. [2025-02-08 09:58:44,777 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 09:58:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:58:44,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-02-08 09:58:44,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:58:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:58:45,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:59:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:59:06,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202515635] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:59:06,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:59:06,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-02-08 09:59:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158786342] [2025-02-08 09:59:06,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:59:06,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-02-08 09:59:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:59:06,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-02-08 09:59:06,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-02-08 09:59:06,053 INFO L87 Difference]: Start difference. First operand 762 states and 762 transitions. Second operand has 384 states, 383 states have (on average 3.475195822454308) internal successors, (1331), 194 states have internal predecessors, (1331), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)