./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cd40341b80aac7a99d3a91b3bc238a3d4a979d431e9f6b808274406ea6962645 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 16:59:13,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 16:59:13,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 16:59:13,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 16:59:13,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 16:59:13,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 16:59:13,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 16:59:13,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 16:59:13,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 16:59:13,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 16:59:13,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 16:59:13,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 16:59:13,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 16:59:13,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 16:59:13,142 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 16:59:13,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 16:59:13,143 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 16:59:13,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 16:59:13,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 16:59:13,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 16:59:13,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 16:59:13,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 16:59:13,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 16:59:13,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:59:13,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 16:59:13,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 16:59:13,146 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/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 -> cd40341b80aac7a99d3a91b3bc238a3d4a979d431e9f6b808274406ea6962645 [2025-03-17 16:59:13,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 16:59:13,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 16:59:13,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 16:59:13,419 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 16:59:13,419 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 16:59:13,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i [2025-03-17 16:59:14,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d100d949d/2ad164cc02484f44808c121e99583da1/FLAGc2a529701 [2025-03-17 16:59:14,938 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 16:59:14,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_add_15_good.i [2025-03-17 16:59:14,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d100d949d/2ad164cc02484f44808c121e99583da1/FLAGc2a529701 [2025-03-17 16:59:15,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d100d949d/2ad164cc02484f44808c121e99583da1 [2025-03-17 16:59:15,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 16:59:15,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 16:59:15,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 16:59:15,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 16:59:15,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 16:59:15,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d81680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15, skipping insertion in model container [2025-03-17 16:59:15,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 16:59:15,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:59:15,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 16:59:15,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 16:59:15,855 INFO L204 MainTranslator]: Completed translation [2025-03-17 16:59:15,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15 WrapperNode [2025-03-17 16:59:15,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 16:59:15,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 16:59:15,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 16:59:15,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 16:59:15,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,895 INFO L138 Inliner]: procedures = 501, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 165 [2025-03-17 16:59:15,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 16:59:15,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 16:59:15,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 16:59:15,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 16:59:15,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,911 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 16:59:15,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 16:59:15,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 16:59:15,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 16:59:15,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 16:59:15,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (1/1) ... [2025-03-17 16:59:15,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 16:59:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 16:59:15,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 16:59:15,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 16:59:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 16:59:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 16:59:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 16:59:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 16:59:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 16:59:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 16:59:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 16:59:16,095 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 16:59:16,097 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 16:59:16,272 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-17 16:59:16,272 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 16:59:16,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 16:59:16,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 16:59:16,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:59:16 BoogieIcfgContainer [2025-03-17 16:59:16,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 16:59:16,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 16:59:16,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 16:59:16,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 16:59:16,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:59:15" (1/3) ... [2025-03-17 16:59:16,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a740449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:59:16, skipping insertion in model container [2025-03-17 16:59:16,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:59:15" (2/3) ... [2025-03-17 16:59:16,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a740449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:59:16, skipping insertion in model container [2025-03-17 16:59:16,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:59:16" (3/3) ... [2025-03-17 16:59:16,286 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_add_15_good.i [2025-03-17 16:59:16,296 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 16:59:16,298 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fscanf_add_15_good.i that has 3 procedures, 74 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-17 16:59:16,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 16:59:16,344 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;@58f8f5ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 16:59:16,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 16:59:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 65 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 16:59:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 16:59:16,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:16,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:59:16,352 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-03-17 16:59:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1768831857, now seen corresponding path program 1 times [2025-03-17 16:59:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085082702] [2025-03-17 16:59:16,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:16,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 16:59:16,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 16:59:16,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:16,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 16:59:16,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085082702] [2025-03-17 16:59:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085082702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:59:16,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423997516] [2025-03-17 16:59:16,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:16,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:16,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:16,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:16,653 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.574468085106383) internal successors, (74), 65 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-03-17 16:59:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:16,688 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2025-03-17 16:59:16,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:16,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-03-17 16:59:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:16,695 INFO L225 Difference]: With dead ends: 75 [2025-03-17 16:59:16,695 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 16:59:16,698 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-03-17 16:59:16,703 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:16,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 187 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 16:59:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-03-17 16:59:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 57 states have internal predecessors, (65), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 16:59:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2025-03-17 16:59:16,736 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 13 [2025-03-17 16:59:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:16,737 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2025-03-17 16:59:16,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-03-17 16:59:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2025-03-17 16:59:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 16:59:16,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:16,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:59:16,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 16:59:16,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:16,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1000787218, now seen corresponding path program 1 times [2025-03-17 16:59:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:16,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240408261] [2025-03-17 16:59:16,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:16,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 16:59:16,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 16:59:16,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:16,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 16:59:16,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:16,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240408261] [2025-03-17 16:59:16,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240408261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:16,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:59:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311557346] [2025-03-17 16:59:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:16,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:16,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:16,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:16,803 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-03-17 16:59:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:16,827 INFO L93 Difference]: Finished difference Result 118 states and 167 transitions. [2025-03-17 16:59:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03-17 16:59:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:16,829 INFO L225 Difference]: With dead ends: 118 [2025-03-17 16:59:16,829 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 16:59:16,829 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-03-17 16:59:16,832 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:16,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 176 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 16:59:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-17 16:59:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 60 states have internal predecessors, (70), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 16:59:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2025-03-17 16:59:16,841 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 14 [2025-03-17 16:59:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:16,841 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2025-03-17 16:59:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03-17 16:59:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2025-03-17 16:59:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 16:59:16,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:16,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:59:16,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 16:59:16,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:16,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1832115564, now seen corresponding path program 1 times [2025-03-17 16:59:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:16,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932947858] [2025-03-17 16:59:16,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:16,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 16:59:16,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 16:59:16,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:16,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 16:59:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932947858] [2025-03-17 16:59:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932947858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:59:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858484178] [2025-03-17 16:59:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:16,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:16,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:16,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:16,896 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-17 16:59:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:16,911 INFO L93 Difference]: Finished difference Result 114 states and 160 transitions. [2025-03-17 16:59:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:16,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2025-03-17 16:59:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:16,913 INFO L225 Difference]: With dead ends: 114 [2025-03-17 16:59:16,913 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 16:59:16,914 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-03-17 16:59:16,914 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:16,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 16:59:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 16:59:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 60 states have internal predecessors, (68), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 16:59:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2025-03-17 16:59:16,922 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 17 [2025-03-17 16:59:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:16,922 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2025-03-17 16:59:16,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-17 16:59:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2025-03-17 16:59:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 16:59:16,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:16,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:59:16,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 16:59:16,923 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-03-17 16:59:16,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1746489395, now seen corresponding path program 1 times [2025-03-17 16:59:16,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:16,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975654066] [2025-03-17 16:59:16,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:16,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 16:59:16,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 16:59:16,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:16,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 16:59:16,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:16,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975654066] [2025-03-17 16:59:16,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975654066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:16,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:16,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:59:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492620622] [2025-03-17 16:59:16,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:16,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:16,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:16,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:16,962 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-03-17 16:59:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:16,971 INFO L93 Difference]: Finished difference Result 114 states and 158 transitions. [2025-03-17 16:59:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:16,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2025-03-17 16:59:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:16,972 INFO L225 Difference]: With dead ends: 114 [2025-03-17 16:59:16,972 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 16:59:16,973 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-03-17 16:59:16,973 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 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-03-17 16:59:16,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 16:59:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 16:59:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 states have internal predecessors, (66), 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-03-17 16:59:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2025-03-17 16:59:16,981 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 21 [2025-03-17 16:59:16,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:16,982 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2025-03-17 16:59:16,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-03-17 16:59:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2025-03-17 16:59:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 16:59:16,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:16,982 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] [2025-03-17 16:59:16,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 16:59:16,982 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-03-17 16:59:16,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:16,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1617255192, now seen corresponding path program 1 times [2025-03-17 16:59:16,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:16,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733445856] [2025-03-17 16:59:16,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:16,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 16:59:17,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 16:59:17,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 16:59:17,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733445856] [2025-03-17 16:59:17,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733445856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:59:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970468292] [2025-03-17 16:59:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,039 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-03-17 16:59:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,053 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2025-03-17 16:59:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2025-03-17 16:59:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,055 INFO L225 Difference]: With dead ends: 67 [2025-03-17 16:59:17,055 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 16:59:17,056 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-03-17 16:59:17,057 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 16:59:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-03-17 16:59:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 58 states have internal predecessors, (65), 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-03-17 16:59:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-03-17 16:59:17,064 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 23 [2025-03-17 16:59:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,064 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-03-17 16:59:17,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-03-17 16:59:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-03-17 16:59:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 16:59:17,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,065 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-03-17 16:59:17,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 16:59:17,065 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-03-17 16:59:17,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1404696639, now seen corresponding path program 1 times [2025-03-17 16:59:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183639856] [2025-03-17 16:59:17,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 16:59:17,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 16:59:17,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 16:59:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183639856] [2025-03-17 16:59:17,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183639856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:59:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574205015] [2025-03-17 16:59:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,108 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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-03-17 16:59:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,135 INFO L93 Difference]: Finished difference Result 103 states and 140 transitions. [2025-03-17 16:59:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 24 [2025-03-17 16:59:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,136 INFO L225 Difference]: With dead ends: 103 [2025-03-17 16:59:17,136 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 16:59:17,136 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-03-17 16:59:17,137 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 163 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 16:59:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-03-17 16:59:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 60 states have internal predecessors, (68), 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-03-17 16:59:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2025-03-17 16:59:17,141 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 24 [2025-03-17 16:59:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,141 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2025-03-17 16:59:17,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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-03-17 16:59:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2025-03-17 16:59:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 16:59:17,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,142 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, 1, 1] [2025-03-17 16:59:17,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 16:59:17,142 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-03-17 16:59:17,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash 619830640, now seen corresponding path program 1 times [2025-03-17 16:59:17,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460542104] [2025-03-17 16:59:17,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 16:59:17,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 16:59:17,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 16:59:17,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460542104] [2025-03-17 16:59:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460542104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:59:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498237353] [2025-03-17 16:59:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,176 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-03-17 16:59:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,184 INFO L93 Difference]: Finished difference Result 98 states and 131 transitions. [2025-03-17 16:59:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2025-03-17 16:59:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,187 INFO L225 Difference]: With dead ends: 98 [2025-03-17 16:59:17,187 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 16:59:17,187 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-03-17 16:59:17,187 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 16:59:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 16:59:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 58 states have internal predecessors, (64), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 16:59:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-03-17 16:59:17,195 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 28 [2025-03-17 16:59:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,196 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-03-17 16:59:17,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-03-17 16:59:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-03-17 16:59:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 16:59:17,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,198 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-03-17 16:59:17,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 16:59:17,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:17,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash 437281807, now seen corresponding path program 1 times [2025-03-17 16:59:17,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576842989] [2025-03-17 16:59:17,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 16:59:17,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 16:59:17,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 16:59:17,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576842989] [2025-03-17 16:59:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576842989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:59:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809151414] [2025-03-17 16:59:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,239 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-03-17 16:59:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,252 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2025-03-17 16:59:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-03-17 16:59:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,254 INFO L225 Difference]: With dead ends: 74 [2025-03-17 16:59:17,254 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 16:59:17,254 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-03-17 16:59:17,255 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 16:59:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-03-17 16:59:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 62 states have internal predecessors, (69), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 16:59:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-17 16:59:17,262 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 33 [2025-03-17 16:59:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,262 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-17 16:59:17,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 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-03-17 16:59:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-17 16:59:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 16:59:17,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,263 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-03-17 16:59:17,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 16:59:17,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:17,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 437311598, now seen corresponding path program 1 times [2025-03-17 16:59:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137520148] [2025-03-17 16:59:17,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 16:59:17,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 16:59:17,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 16:59:17,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137520148] [2025-03-17 16:59:17,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137520148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:59:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505549887] [2025-03-17 16:59:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,302 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-17 16:59:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,313 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2025-03-17 16:59:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-17 16:59:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,316 INFO L225 Difference]: With dead ends: 96 [2025-03-17 16:59:17,316 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 16:59:17,316 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-03-17 16:59:17,317 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 16:59:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 16:59:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 61 states have internal predecessors, (68), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 16:59:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-17 16:59:17,325 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 33 [2025-03-17 16:59:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,326 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-17 16:59:17,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-17 16:59:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-17 16:59:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 16:59:17,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,327 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-03-17 16:59:17,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 16:59:17,327 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:17,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -198536807, now seen corresponding path program 1 times [2025-03-17 16:59:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085262741] [2025-03-17 16:59:17,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 16:59:17,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 16:59:17,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 16:59:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085262741] [2025-03-17 16:59:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085262741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:59:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819680176] [2025-03-17 16:59:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,362 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 16:59:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,371 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2025-03-17 16:59:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2025-03-17 16:59:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,373 INFO L225 Difference]: With dead ends: 90 [2025-03-17 16:59:17,373 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 16:59:17,374 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-03-17 16:59:17,374 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 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-03-17 16:59:17,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 16:59:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 16:59:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.25) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 16:59:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2025-03-17 16:59:17,382 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 37 [2025-03-17 16:59:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,382 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2025-03-17 16:59:17,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 16:59:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2025-03-17 16:59:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 16:59:17,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,383 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] [2025-03-17 16:59:17,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 16:59:17,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:17,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash -868609483, now seen corresponding path program 1 times [2025-03-17 16:59:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763195460] [2025-03-17 16:59:17,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 16:59:17,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 16:59:17,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 16:59:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763195460] [2025-03-17 16:59:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763195460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:59:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597447540] [2025-03-17 16:59:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,440 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-03-17 16:59:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,449 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2025-03-17 16:59:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 38 [2025-03-17 16:59:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,450 INFO L225 Difference]: With dead ends: 76 [2025-03-17 16:59:17,450 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 16:59:17,452 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-03-17 16:59:17,453 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 16:59:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 16:59:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 53 states have internal predecessors, (57), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 16:59:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-17 16:59:17,456 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 38 [2025-03-17 16:59:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,456 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-17 16:59:17,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-03-17 16:59:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-17 16:59:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 16:59:17,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,457 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, 1] [2025-03-17 16:59:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 16:59:17,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -528405618, now seen corresponding path program 1 times [2025-03-17 16:59:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145371269] [2025-03-17 16:59:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 16:59:17,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 16:59:17,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 16:59:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145371269] [2025-03-17 16:59:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145371269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 16:59:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495302136] [2025-03-17 16:59:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,498 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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-03-17 16:59:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,505 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-17 16:59:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 44 [2025-03-17 16:59:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,507 INFO L225 Difference]: With dead ends: 66 [2025-03-17 16:59:17,507 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 16:59:17,507 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-03-17 16:59:17,508 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 16:59:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 16:59:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 states have internal predecessors, (56), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 16:59:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2025-03-17 16:59:17,513 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 44 [2025-03-17 16:59:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,513 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2025-03-17 16:59:17,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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-03-17 16:59:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2025-03-17 16:59:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 16:59:17,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 16:59:17,514 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, 1, 1] [2025-03-17 16:59:17,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 16:59:17,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 16:59:17,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 16:59:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 801264166, now seen corresponding path program 1 times [2025-03-17 16:59:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 16:59:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189457947] [2025-03-17 16:59:17,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 16:59:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 16:59:17,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 16:59:17,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 16:59:17,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 16:59:17,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 16:59:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 16:59:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 16:59:17,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189457947] [2025-03-17 16:59:17,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189457947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 16:59:17,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 16:59:17,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 16:59:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028042223] [2025-03-17 16:59:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 16:59:17,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 16:59:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 16:59:17,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 16:59:17,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 16:59:17,542 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-03-17 16:59:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 16:59:17,545 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2025-03-17 16:59:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 16:59:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 45 [2025-03-17 16:59:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 16:59:17,546 INFO L225 Difference]: With dead ends: 64 [2025-03-17 16:59:17,546 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 16:59:17,546 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-03-17 16:59:17,546 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 16:59:17,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 16:59:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 16:59:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 16:59:17,547 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-03-17 16:59:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 16:59:17,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2025-03-17 16:59:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 16:59:17,547 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 16:59:17,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-03-17 16:59:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 16:59:17,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 16:59:17,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 16:59:17,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 16:59:17,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 16:59:17,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 16:59:17,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 16:59:17,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 16:59:17,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 16:59:17,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 16:59:17,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 16:59:17,556 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 16:59:17,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 16:59:17,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 16:59:17,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:59:17 BoogieIcfgContainer [2025-03-17 16:59:17,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 16:59:17,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 16:59:17,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 16:59:17,600 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 16:59:17,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:59:16" (3/4) ... [2025-03-17 16:59:17,602 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 16:59:17,605 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 16:59:17,606 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 16:59:17,608 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 16:59:17,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-17 16:59:17,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 16:59:17,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 16:59:17,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 16:59:17,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 16:59:17,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 16:59:17,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 16:59:17,667 INFO L158 Benchmark]: Toolchain (without parser) took 2539.32ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 135.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2025-03-17 16:59:17,667 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:59:17,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.32ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 93.4MB in the end (delta: 60.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-17 16:59:17,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.66ms. Allocated memory is still 201.3MB. Free memory was 93.4MB in the beginning and 90.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:59:17,668 INFO L158 Benchmark]: Boogie Preprocessor took 23.43ms. Allocated memory is still 201.3MB. Free memory was 90.4MB in the beginning and 89.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:59:17,669 INFO L158 Benchmark]: IcfgBuilder took 360.47ms. Allocated memory is still 201.3MB. Free memory was 89.0MB in the beginning and 71.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 16:59:17,669 INFO L158 Benchmark]: TraceAbstraction took 1318.15ms. Allocated memory is still 201.3MB. Free memory was 71.2MB in the beginning and 141.4MB in the end (delta: -70.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:59:17,669 INFO L158 Benchmark]: Witness Printer took 66.51ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 135.2MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 16:59:17,670 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.24ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.32ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 93.4MB in the end (delta: 60.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.66ms. Allocated memory is still 201.3MB. Free memory was 93.4MB in the beginning and 90.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.43ms. Allocated memory is still 201.3MB. Free memory was 90.4MB in the beginning and 89.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.47ms. Allocated memory is still 201.3MB. Free memory was 89.0MB in the beginning and 71.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1318.15ms. Allocated memory is still 201.3MB. Free memory was 71.2MB in the beginning and 141.4MB in the end (delta: -70.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 66.51ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 135.2MB in the end (delta: 6.2MB). There was no memory consumed. 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: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: 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, 74 locations, 122 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 1975 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 942 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1033 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, InterpolantAutomatonStates: 39, 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, 13 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 415 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 100/100 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-03-17 16:59:17,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE