./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_09_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_09_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fee45405504a2c1308e3f6e72b1e8f4a784f936d4e5a3b855990416ea9160727 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 15:44:25,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 15:44:25,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 15:44:25,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 15:44:25,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 15:44:25,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 15:44:25,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 15:44:25,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 15:44:25,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 15:44:25,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 15:44:25,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 15:44:25,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 15:44:25,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 15:44:25,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 15:44:25,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 15:44:25,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 15:44:25,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 15:44:25,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 15:44:25,230 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fee45405504a2c1308e3f6e72b1e8f4a784f936d4e5a3b855990416ea9160727 [2025-02-06 15:44:25,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 15:44:25,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 15:44:25,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 15:44:25,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 15:44:25,470 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 15:44:25,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_09_good.i [2025-02-06 15:44:26,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2a1ce22f/bdb95fee5f2c45dc9a9f8ae714df6ed5/FLAGfaba4fb9a [2025-02-06 15:44:27,067 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 15:44:27,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_09_good.i [2025-02-06 15:44:27,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2a1ce22f/bdb95fee5f2c45dc9a9f8ae714df6ed5/FLAGfaba4fb9a [2025-02-06 15:44:27,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2a1ce22f/bdb95fee5f2c45dc9a9f8ae714df6ed5 [2025-02-06 15:44:27,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 15:44:27,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 15:44:27,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 15:44:27,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 15:44:27,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 15:44:27,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:27" (1/1) ... [2025-02-06 15:44:27,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a12ba77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:27, skipping insertion in model container [2025-02-06 15:44:27,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:44:27" (1/1) ... [2025-02-06 15:44:27,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 15:44:27,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 15:44:27,845 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 15:44:27,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 15:44:28,013 INFO L204 MainTranslator]: Completed translation [2025-02-06 15:44:28,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28 WrapperNode [2025-02-06 15:44:28,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 15:44:28,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 15:44:28,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 15:44:28,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 15:44:28,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,052 INFO L138 Inliner]: procedures = 502, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2025-02-06 15:44:28,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 15:44:28,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 15:44:28,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 15:44:28,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 15:44:28,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,073 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-02-06 15:44:28,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 15:44:28,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 15:44:28,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 15:44:28,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 15:44:28,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (1/1) ... [2025-02-06 15:44:28,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 15:44:28,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 15:44:28,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 15:44:28,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 15:44:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 15:44:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 15:44:28,153 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 15:44:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 15:44:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 15:44:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 15:44:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 15:44:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 15:44:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 15:44:28,264 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 15:44:28,265 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 15:44:28,395 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-06 15:44:28,395 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 15:44:28,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 15:44:28,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 15:44:28,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:28 BoogieIcfgContainer [2025-02-06 15:44:28,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 15:44:28,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 15:44:28,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 15:44:28,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 15:44:28,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:44:27" (1/3) ... [2025-02-06 15:44:28,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf03717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:28, skipping insertion in model container [2025-02-06 15:44:28,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:44:28" (2/3) ... [2025-02-06 15:44:28,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf03717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:44:28, skipping insertion in model container [2025-02-06 15:44:28,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:28" (3/3) ... [2025-02-06 15:44:28,414 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_09_good.i [2025-02-06 15:44:28,426 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 15:44:28,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_09_good.i that has 3 procedures, 65 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 15:44:28,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 15:44:28,512 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;@335dc4f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 15:44:28,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 15:44:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.5) internal successors, (63), 56 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 15:44:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 15:44:28,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:28,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:28,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:28,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:28,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1788494176, now seen corresponding path program 1 times [2025-02-06 15:44:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:28,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-02-06 15:44:28,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:28,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 15:44:28,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 15:44:28,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:28,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 15:44:28,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:28,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382040879] [2025-02-06 15:44:28,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382040879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:28,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:28,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 15:44:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998768034] [2025-02-06 15:44:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:28,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:44:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:44:28,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:28,809 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.5) internal successors, (63), 56 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 15:44:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:28,853 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2025-02-06 15:44:28,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:44:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-02-06 15:44:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:28,860 INFO L225 Difference]: With dead ends: 122 [2025-02-06 15:44:28,860 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 15:44:28,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:28,866 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:28,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 15:44:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 15:44:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 49 states have internal predecessors, (50), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 15:44:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-06 15:44:28,906 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 12 [2025-02-06 15:44:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:28,906 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-06 15:44:28,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-06 15:44:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-02-06 15:44:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 15:44:28,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:28,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:28,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 15:44:28,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash -782611166, now seen corresponding path program 1 times [2025-02-06 15:44:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115407971] [2025-02-06 15:44:28,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:28,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 15:44:28,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 15:44:28,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:28,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 15:44:29,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115407971] [2025-02-06 15:44:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115407971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:29,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:29,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 15:44:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901604594] [2025-02-06 15:44:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:29,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 15:44:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:29,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 15:44:29,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,057 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 15:44:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:29,085 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-02-06 15:44:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 15:44:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2025-02-06 15:44:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:29,086 INFO L225 Difference]: With dead ends: 57 [2025-02-06 15:44:29,087 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 15:44:29,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,088 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:29,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 15:44:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2025-02-06 15:44:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 48 states have internal predecessors, (49), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 15:44:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-02-06 15:44:29,099 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 14 [2025-02-06 15:44:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:29,099 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-02-06 15:44:29,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 15:44:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-02-06 15:44:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 15:44:29,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:29,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:29,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 15:44:29,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:29,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1508857656, now seen corresponding path program 1 times [2025-02-06 15:44:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-02-06 15:44:29,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:29,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 15:44:29,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 15:44:29,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:29,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 15:44:29,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005088799] [2025-02-06 15:44:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005088799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:29,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:29,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:44:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819789212] [2025-02-06 15:44:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:29,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:44:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:29,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:44:29,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:29,186 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-06 15:44:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:29,206 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-02-06 15:44:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:44:29,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-02-06 15:44:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:29,207 INFO L225 Difference]: With dead ends: 55 [2025-02-06 15:44:29,208 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 15:44:29,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:29,208 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:29,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 15:44:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-06 15:44:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 47 states have internal predecessors, (48), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 15:44:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-02-06 15:44:29,218 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 15 [2025-02-06 15:44:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:29,218 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-02-06 15:44:29,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-06 15:44:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-02-06 15:44:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 15:44:29,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:29,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 15:44:29,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:29,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1963272992, now seen corresponding path program 1 times [2025-02-06 15:44:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979826621] [2025-02-06 15:44:29,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 15:44:29,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 15:44:29,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:29,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 15:44:29,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:29,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979826621] [2025-02-06 15:44:29,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979826621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:29,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:29,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 15:44:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147907198] [2025-02-06 15:44:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:29,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:44:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:29,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:44:29,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:29,293 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 15:44:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:29,300 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-02-06 15:44:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:44:29,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-02-06 15:44:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:29,301 INFO L225 Difference]: With dead ends: 91 [2025-02-06 15:44:29,301 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 15:44:29,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:29,302 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:29,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 15:44:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 15:44:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 45 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 15:44:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-02-06 15:44:29,306 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 24 [2025-02-06 15:44:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:29,306 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-02-06 15:44:29,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 15:44:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-02-06 15:44:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 15:44:29,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:29,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:29,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 15:44:29,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:29,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1695299535, now seen corresponding path program 1 times [2025-02-06 15:44:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:29,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929757660] [2025-02-06 15:44:29,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:29,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 15:44:29,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 15:44:29,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:29,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 15:44:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929757660] [2025-02-06 15:44:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929757660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 15:44:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034332800] [2025-02-06 15:44:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:29,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 15:44:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:29,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 15:44:29,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,376 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 15:44:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:29,391 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-02-06 15:44:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 15:44:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-06 15:44:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:29,392 INFO L225 Difference]: With dead ends: 52 [2025-02-06 15:44:29,392 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 15:44:29,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,393 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:29,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 15:44:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 15:44:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 44 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 15:44:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-02-06 15:44:29,397 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 25 [2025-02-06 15:44:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:29,397 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-02-06 15:44:29,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 15:44:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-02-06 15:44:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 15:44:29,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:29,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:29,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 15:44:29,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:29,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1014678026, now seen corresponding path program 1 times [2025-02-06 15:44:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635826530] [2025-02-06 15:44:29,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:29,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 15:44:29,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 15:44:29,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:29,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 15:44:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:29,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635826530] [2025-02-06 15:44:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635826530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:29,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 15:44:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313893516] [2025-02-06 15:44:29,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 15:44:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:29,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 15:44:29,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:29,457 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 15:44:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:29,465 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-02-06 15:44:29,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 15:44:29,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-06 15:44:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:29,467 INFO L225 Difference]: With dead ends: 51 [2025-02-06 15:44:29,467 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 15:44:29,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 15:44:29,468 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:29,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 15:44:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 15:44:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 43 states have internal predecessors, (44), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 15:44:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-02-06 15:44:29,472 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 26 [2025-02-06 15:44:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-02-06 15:44:29,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 15:44:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-02-06 15:44:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 15:44:29,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:29,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:29,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 15:44:29,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:29,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash 912174188, now seen corresponding path program 1 times [2025-02-06 15:44:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:29,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776725253] [2025-02-06 15:44:29,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:29,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 15:44:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 15:44:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 15:44:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776725253] [2025-02-06 15:44:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776725253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 15:44:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890305867] [2025-02-06 15:44:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:29,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 15:44:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:29,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 15:44:29,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,548 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 15:44:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:29,560 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-02-06 15:44:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 15:44:29,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-02-06 15:44:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:29,561 INFO L225 Difference]: With dead ends: 50 [2025-02-06 15:44:29,561 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 15:44:29,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,562 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:29,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 15:44:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 15:44:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 41 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 15:44:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-02-06 15:44:29,566 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 33 [2025-02-06 15:44:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:29,566 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-06 15:44:29,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 15:44:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-02-06 15:44:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 15:44:29,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 15:44:29,567 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:29,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 15:44:29,567 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 15:44:29,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 15:44:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1599607002, now seen corresponding path program 1 times [2025-02-06 15:44:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 15:44:29,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014623348] [2025-02-06 15:44:29,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 15:44:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 15:44:29,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 15:44:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 15:44:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 15:44:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 15:44:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 15:44:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 15:44:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014623348] [2025-02-06 15:44:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014623348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 15:44:29,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 15:44:29,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 15:44:29,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017159927] [2025-02-06 15:44:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 15:44:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 15:44:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 15:44:29,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 15:44:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,620 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 15:44:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 15:44:29,631 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-02-06 15:44:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 15:44:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-02-06 15:44:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 15:44:29,631 INFO L225 Difference]: With dead ends: 48 [2025-02-06 15:44:29,631 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 15:44:29,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 15:44:29,632 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 15:44:29,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 15:44:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 15:44:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 15:44:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 15:44:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 15:44:29,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-02-06 15:44:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 15:44:29,633 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 15:44:29,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 15:44:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 15:44:29,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 15:44:29,640 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 15:44:29,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 15:44:29,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 15:44:29,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 15:44:29,766 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 15:44:29,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:44:29 BoogieIcfgContainer [2025-02-06 15:44:29,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 15:44:29,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 15:44:29,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 15:44:29,772 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 15:44:29,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:44:28" (3/4) ... [2025-02-06 15:44:29,774 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 15:44:29,778 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 15:44:29,778 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 15:44:29,782 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 15:44:29,783 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 15:44:29,784 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 15:44:29,784 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 15:44:29,784 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 15:44:29,853 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 15:44:29,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 15:44:29,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 15:44:29,855 INFO L158 Benchmark]: Toolchain (without parser) took 2614.62ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 64.7MB in the end (delta: 46.7MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-02-06 15:44:29,855 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:44:29,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 772.84ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 51.5MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 15:44:29,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.27ms. Allocated memory is still 142.6MB. Free memory was 51.5MB in the beginning and 48.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 15:44:29,855 INFO L158 Benchmark]: Boogie Preprocessor took 31.08ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 47.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 15:44:29,856 INFO L158 Benchmark]: IcfgBuilder took 322.01ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 99.5MB in the end (delta: -52.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-02-06 15:44:29,856 INFO L158 Benchmark]: TraceAbstraction took 1362.96ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 70.9MB in the end (delta: 28.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2025-02-06 15:44:29,856 INFO L158 Benchmark]: Witness Printer took 82.17ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 64.7MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 15:44:29,858 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 772.84ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 51.5MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.27ms. Allocated memory is still 142.6MB. Free memory was 51.5MB in the beginning and 48.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.08ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 47.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 322.01ms. Allocated memory is still 142.6MB. Free memory was 47.2MB in the beginning and 99.5MB in the end (delta: -52.2MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1362.96ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 70.9MB in the end (delta: 28.6MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 82.17ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 64.7MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1648]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 546 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 489 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 15:44:29,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE