./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_15_good.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7a5f1c43254eae197d03efa68455ef6422275d63efdf4546b7cd8beaa99c97f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:21:55,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:21:55,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 17:21:55,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:21:55,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:21:55,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:21:55,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:21:55,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:21:55,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:21:55,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:21:55,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:21:55,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:21:55,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:21:55,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:21:55,341 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:21:55,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:21:55,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:21:55,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:21:55,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:21:55,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:21:55,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:21:55,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:21:55,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:21:55,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:21:55,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:21:55,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:21:55,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:21:55,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:21:55,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:21:55,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:21:55,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:21:55,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:21:55,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:21:55,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:21:55,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:21:55,345 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a5f1c43254eae197d03efa68455ef6422275d63efdf4546b7cd8beaa99c97f3 [2025-02-06 17:21:55,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:21:55,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:21:55,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:21:55,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:21:55,573 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:21:55,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_15_good.i [2025-02-06 17:21:56,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5033f4d/b69dc93fb32745ddbb808ae760924496/FLAGb2126c6b2 [2025-02-06 17:21:57,011 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:21:57,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_15_good.i [2025-02-06 17:21:57,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5033f4d/b69dc93fb32745ddbb808ae760924496/FLAGb2126c6b2 [2025-02-06 17:21:57,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f5033f4d/b69dc93fb32745ddbb808ae760924496 [2025-02-06 17:21:57,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:21:57,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:21:57,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:21:57,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:21:57,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:21:57,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:21:57" (1/1) ... [2025-02-06 17:21:57,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53724da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:57, skipping insertion in model container [2025-02-06 17:21:57,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:21:57" (1/1) ... [2025-02-06 17:21:57,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:21:57,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:21:57,933 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:21:57,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:21:58,067 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:21:58,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58 WrapperNode [2025-02-06 17:21:58,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:21:58,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:21:58,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:21:58,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:21:58,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,105 INFO L138 Inliner]: procedures = 502, calls = 58, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2025-02-06 17:21:58,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:21:58,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:21:58,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:21:58,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:21:58,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,128 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-02-06 17:21:58,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:21:58,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:21:58,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:21:58,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:21:58,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (1/1) ... [2025-02-06 17:21:58,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:21:58,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:21:58,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 17:21:58,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 17:21:58,199 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-06 17:21:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-06 17:21:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-06 17:21:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-06 17:21:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:21:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:21:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:21:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 17:21:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 17:21:58,313 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:21:58,315 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:21:58,505 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-02-06 17:21:58,505 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:21:58,516 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:21:58,516 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:21:58,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:21:58 BoogieIcfgContainer [2025-02-06 17:21:58,517 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:21:58,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:21:58,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:21:58,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:21:58,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:21:57" (1/3) ... [2025-02-06 17:21:58,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe6534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:21:58, skipping insertion in model container [2025-02-06 17:21:58,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:21:58" (2/3) ... [2025-02-06 17:21:58,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe6534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:21:58, skipping insertion in model container [2025-02-06 17:21:58,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:21:58" (3/3) ... [2025-02-06 17:21:58,525 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_15_good.i [2025-02-06 17:21:58,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:21:58,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_multiply_15_good.i that has 3 procedures, 91 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 17:21:58,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:21:58,594 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;@25b94e69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:21:58,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 17:21:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 62 states have (on average 1.532258064516129) internal successors, (95), 82 states have internal predecessors, (95), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 17:21:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 17:21:58,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:58,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:58,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:58,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -228667493, now seen corresponding path program 1 times [2025-02-06 17:21:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692117362] [2025-02-06 17:21:58,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:58,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 17:21:58,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 17:21:58,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:58,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:58,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692117362] [2025-02-06 17:21:58,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692117362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:58,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:58,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:21:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989693918] [2025-02-06 17:21:58,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:58,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:58,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:58,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:58,814 INFO L87 Difference]: Start difference. First operand has 91 states, 62 states have (on average 1.532258064516129) internal successors, (95), 82 states have internal predecessors, (95), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:58,841 INFO L93 Difference]: Finished difference Result 172 states and 246 transitions. [2025-02-06 17:21:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:58,844 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), 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 16 [2025-02-06 17:21:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:58,850 INFO L225 Difference]: With dead ends: 172 [2025-02-06 17:21:58,850 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 17:21:58,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:58,854 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:58,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 17:21:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 17:21:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.509433962264151) internal successors, (80), 70 states have internal predecessors, (80), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 17:21:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2025-02-06 17:21:58,889 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 108 transitions. Word has length 16 [2025-02-06 17:21:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:58,890 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 108 transitions. [2025-02-06 17:21:58,890 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2025-02-06 17:21:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 17:21:58,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:58,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:21:58,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1155204635, now seen corresponding path program 1 times [2025-02-06 17:21:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934997710] [2025-02-06 17:21:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:58,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 17:21:58,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 17:21:58,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:58,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934997710] [2025-02-06 17:21:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934997710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:21:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264929901] [2025-02-06 17:21:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,024 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. Second operand has 3 states, 2 states have (on average 7.5) 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-02-06 17:21:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,064 INFO L93 Difference]: Finished difference Result 143 states and 201 transitions. [2025-02-06 17:21:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) 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-02-06 17:21:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,068 INFO L225 Difference]: With dead ends: 143 [2025-02-06 17:21:59,069 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 17:21:59,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,070 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 209 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 17:21:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2025-02-06 17:21:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 74 states have internal predecessors, (88), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 17:21:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-02-06 17:21:59,079 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 17 [2025-02-06 17:21:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,079 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-02-06 17:21:59,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) 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-02-06 17:21:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-02-06 17:21:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 17:21:59,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 17:21:59,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1451605397, now seen corresponding path program 1 times [2025-02-06 17:21:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545272343] [2025-02-06 17:21:59,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 17:21:59,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 17:21:59,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545272343] [2025-02-06 17:21:59,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545272343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:21:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347512301] [2025-02-06 17:21:59,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,141 INFO L87 Difference]: Start difference. First operand 82 states and 116 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,160 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2025-02-06 17:21:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,160 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, (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 18 [2025-02-06 17:21:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,162 INFO L225 Difference]: With dead ends: 82 [2025-02-06 17:21:59,163 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 17:21:59,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,164 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 17:21:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 17:21:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 73 states have internal predecessors, (87), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 17:21:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-02-06 17:21:59,173 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 18 [2025-02-06 17:21:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,175 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-02-06 17:21:59,175 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-02-06 17:21:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 17:21:59,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:21:59,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1073981384, now seen corresponding path program 1 times [2025-02-06 17:21:59,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75039115] [2025-02-06 17:21:59,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 17:21:59,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 17:21:59,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75039115] [2025-02-06 17:21:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75039115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:21:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308723590] [2025-02-06 17:21:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,270 INFO L87 Difference]: Start difference. First operand 81 states and 115 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,287 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2025-02-06 17:21:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,287 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, (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 23 [2025-02-06 17:21:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,288 INFO L225 Difference]: With dead ends: 137 [2025-02-06 17:21:59,288 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 17:21:59,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,289 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 17:21:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 17:21:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 17:21:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2025-02-06 17:21:59,294 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 23 [2025-02-06 17:21:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,294 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2025-02-06 17:21:59,294 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2025-02-06 17:21:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 17:21:59,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 17:21:59,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2117744355, now seen corresponding path program 1 times [2025-02-06 17:21:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698467737] [2025-02-06 17:21:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 17:21:59,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 17:21:59,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698467737] [2025-02-06 17:21:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698467737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:21:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290892018] [2025-02-06 17:21:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,340 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,357 INFO L93 Difference]: Finished difference Result 129 states and 177 transitions. [2025-02-06 17:21:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2025-02-06 17:21:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,359 INFO L225 Difference]: With dead ends: 129 [2025-02-06 17:21:59,359 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 17:21:59,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,360 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 17:21:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-06 17:21:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 71 states have internal predecessors, (82), 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-02-06 17:21:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2025-02-06 17:21:59,369 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 24 [2025-02-06 17:21:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,370 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2025-02-06 17:21:59,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2025-02-06 17:21:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 17:21:59,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 17:21:59,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1493195887, now seen corresponding path program 1 times [2025-02-06 17:21:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127510397] [2025-02-06 17:21:59,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 17:21:59,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 17:21:59,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127510397] [2025-02-06 17:21:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127510397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:21:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461656642] [2025-02-06 17:21:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,427 INFO L87 Difference]: Start difference. First operand 79 states and 108 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,448 INFO L93 Difference]: Finished difference Result 124 states and 168 transitions. [2025-02-06 17:21:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (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 25 [2025-02-06 17:21:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,449 INFO L225 Difference]: With dead ends: 124 [2025-02-06 17:21:59,449 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 17:21:59,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,450 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 193 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 17:21:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-02-06 17:21:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 74 states have internal predecessors, (88), 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-02-06 17:21:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2025-02-06 17:21:59,455 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 25 [2025-02-06 17:21:59,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,455 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-02-06 17:21:59,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2025-02-06 17:21:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 17:21:59,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 17:21:59,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash -955567710, now seen corresponding path program 1 times [2025-02-06 17:21:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998545837] [2025-02-06 17:21:59,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 17:21:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 17:21:59,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998545837] [2025-02-06 17:21:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998545837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:21:59,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601173802] [2025-02-06 17:21:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,517 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,539 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2025-02-06 17:21:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (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 26 [2025-02-06 17:21:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,541 INFO L225 Difference]: With dead ends: 83 [2025-02-06 17:21:59,541 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 17:21:59,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,542 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 17:21:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 17:21:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.380952380952381) internal successors, (87), 73 states have internal predecessors, (87), 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-02-06 17:21:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2025-02-06 17:21:59,551 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 26 [2025-02-06 17:21:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,551 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2025-02-06 17:21:59,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2025-02-06 17:21:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 17:21:59,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 17:21:59,553 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-02-06 17:21:59,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash -203238266, now seen corresponding path program 1 times [2025-02-06 17:21:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715497406] [2025-02-06 17:21:59,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 17:21:59,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 17:21:59,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715497406] [2025-02-06 17:21:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715497406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:21:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643275487] [2025-02-06 17:21:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,630 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,647 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2025-02-06 17:21:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 31 [2025-02-06 17:21:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,649 INFO L225 Difference]: With dead ends: 84 [2025-02-06 17:21:59,649 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 17:21:59,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,649 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 173 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 17:21:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-06 17:21:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 72 states have internal predecessors, (86), 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-02-06 17:21:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2025-02-06 17:21:59,654 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 31 [2025-02-06 17:21:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,654 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2025-02-06 17:21:59,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2025-02-06 17:21:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 17:21:59,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 17:21:59,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2005418930, now seen corresponding path program 1 times [2025-02-06 17:21:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4208491] [2025-02-06 17:21:59,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 17:21:59,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 17:21:59,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4208491] [2025-02-06 17:21:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4208491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:21:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906825888] [2025-02-06 17:21:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,705 INFO L87 Difference]: Start difference. First operand 81 states and 112 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,723 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2025-02-06 17:21:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,723 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, (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 32 [2025-02-06 17:21:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,724 INFO L225 Difference]: With dead ends: 107 [2025-02-06 17:21:59,724 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 17:21:59,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,725 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 183 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 17:21:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-02-06 17:21:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 77 states have internal predecessors, (92), 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-02-06 17:21:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-02-06 17:21:59,730 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 32 [2025-02-06 17:21:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,730 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-02-06 17:21:59,730 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-02-06 17:21:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 17:21:59,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 17:21:59,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1976789779, now seen corresponding path program 1 times [2025-02-06 17:21:59,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022783049] [2025-02-06 17:21:59,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 17:21:59,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 17:21:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022783049] [2025-02-06 17:21:59,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022783049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:21:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033468680] [2025-02-06 17:21:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,779 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,790 INFO L93 Difference]: Finished difference Result 115 states and 153 transitions. [2025-02-06 17:21:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 32 [2025-02-06 17:21:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,791 INFO L225 Difference]: With dead ends: 115 [2025-02-06 17:21:59,791 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 17:21:59,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,792 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 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-02-06 17:21:59,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 17:21:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-06 17:21:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.338235294117647) internal successors, (91), 76 states have internal predecessors, (91), 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-02-06 17:21:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2025-02-06 17:21:59,797 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 32 [2025-02-06 17:21:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,797 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2025-02-06 17:21:59,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2025-02-06 17:21:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 17:21:59,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,798 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 17:21:59,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1454075119, now seen corresponding path program 1 times [2025-02-06 17:21:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510353684] [2025-02-06 17:21:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 17:21:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 17:21:59,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 17:21:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510353684] [2025-02-06 17:21:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510353684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:21:59,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081667287] [2025-02-06 17:21:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,836 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:21:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,843 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2025-02-06 17:21:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 36 [2025-02-06 17:21:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,845 INFO L225 Difference]: With dead ends: 109 [2025-02-06 17:21:59,845 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 17:21:59,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,845 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 17:21:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-06 17:21:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 70 states have internal predecessors, (82), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 17:21:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2025-02-06 17:21:59,850 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 36 [2025-02-06 17:21:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,850 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2025-02-06 17:21:59,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:21:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2025-02-06 17:21:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 17:21:59,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 17:21:59,852 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-02-06 17:21:59,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1457281730, now seen corresponding path program 1 times [2025-02-06 17:21:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156023149] [2025-02-06 17:21:59,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 17:21:59,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 17:21:59,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156023149] [2025-02-06 17:21:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156023149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:21:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939073386] [2025-02-06 17:21:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,889 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,900 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2025-02-06 17:21:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 37 [2025-02-06 17:21:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,902 INFO L225 Difference]: With dead ends: 95 [2025-02-06 17:21:59,902 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 17:21:59,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,902 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-02-06 17:21:59,903 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-02-06 17:21:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 17:21:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 17:21:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 68 states have internal predecessors, (79), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 17:21:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2025-02-06 17:21:59,908 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 37 [2025-02-06 17:21:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,908 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2025-02-06 17:21:59,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:21:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2025-02-06 17:21:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 17:21:59,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 17:21:59,911 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-02-06 17:21:59,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1959967807, now seen corresponding path program 1 times [2025-02-06 17:21:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309564539] [2025-02-06 17:21:59,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 17:21:59,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 17:21:59,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:21:59,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:21:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:21:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:21:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309564539] [2025-02-06 17:21:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309564539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:21:59,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:21:59,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:21:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946038964] [2025-02-06 17:21:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:21:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:21:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:21:59,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:21:59,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,968 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:21:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:21:59,975 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2025-02-06 17:21:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:21:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 44 [2025-02-06 17:21:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:21:59,976 INFO L225 Difference]: With dead ends: 77 [2025-02-06 17:21:59,976 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 17:21:59,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:21:59,977 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:21:59,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:21:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 17:21:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 17:21:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 67 states have internal predecessors, (78), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 17:21:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2025-02-06 17:21:59,981 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 44 [2025-02-06 17:21:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:21:59,981 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2025-02-06 17:21:59,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:21:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2025-02-06 17:21:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 17:21:59,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:21:59,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:21:59,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 17:21:59,982 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:21:59,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:21:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 629459864, now seen corresponding path program 1 times [2025-02-06 17:21:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:21:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374963795] [2025-02-06 17:21:59,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:21:59,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:21:59,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 17:21:59,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 17:22:00,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:22:00,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:22:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:22:00,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:22:00,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374963795] [2025-02-06 17:22:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374963795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:22:00,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:22:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:22:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528966471] [2025-02-06 17:22:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:22:00,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:22:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:22:00,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:22:00,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:22:00,038 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:22:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:22:00,056 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2025-02-06 17:22:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:22:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 45 [2025-02-06 17:22:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:22:00,059 INFO L225 Difference]: With dead ends: 82 [2025-02-06 17:22:00,059 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 17:22:00,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:22:00,060 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 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-02-06 17:22:00,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:22:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 17:22:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 17:22:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 67 states have internal predecessors, (77), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 17:22:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2025-02-06 17:22:00,066 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 45 [2025-02-06 17:22:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:22:00,066 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2025-02-06 17:22:00,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:22:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2025-02-06 17:22:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 17:22:00,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:22:00,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:22:00,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 17:22:00,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 17:22:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:22:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash -69224610, now seen corresponding path program 1 times [2025-02-06 17:22:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:22:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934831244] [2025-02-06 17:22:00,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:22:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:22:00,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 17:22:00,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 17:22:00,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:22:00,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:22:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:22:00,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:22:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934831244] [2025-02-06 17:22:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934831244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:22:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:22:00,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:22:00,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322314265] [2025-02-06 17:22:00,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:22:00,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:22:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:22:00,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:22:00,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:22:00,113 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:22:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:22:00,117 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2025-02-06 17:22:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:22:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 46 [2025-02-06 17:22:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:22:00,118 INFO L225 Difference]: With dead ends: 80 [2025-02-06 17:22:00,118 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 17:22:00,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:22:00,118 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 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-02-06 17:22:00,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:22:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 17:22:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 17:22:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:22:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 17:22:00,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2025-02-06 17:22:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:22:00,119 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 17:22:00,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:22:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 17:22:00,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 17:22:00,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 17:22:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 17:22:00,128 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:22:00,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 17:22:00,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 17:22:00,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:22:00 BoogieIcfgContainer [2025-02-06 17:22:00,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 17:22:00,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 17:22:00,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 17:22:00,168 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 17:22:00,169 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:21:58" (3/4) ... [2025-02-06 17:22:00,170 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 17:22:00,174 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-06 17:22:00,174 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-06 17:22:00,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-06 17:22:00,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 17:22:00,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 17:22:00,180 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 17:22:00,180 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 17:22:00,243 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 17:22:00,244 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 17:22:00,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 17:22:00,244 INFO L158 Benchmark]: Toolchain (without parser) took 2969.86ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 110.0MB in the beginning and 251.1MB in the end (delta: -141.1MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. [2025-02-06 17:22:00,244 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:22:00,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 793.13ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 47.4MB in the end (delta: 62.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 17:22:00,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.94ms. Allocated memory is still 142.6MB. Free memory was 47.4MB in the beginning and 44.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:22:00,245 INFO L158 Benchmark]: Boogie Preprocessor took 30.11ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 42.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:22:00,245 INFO L158 Benchmark]: IcfgBuilder took 380.35ms. Allocated memory is still 142.6MB. Free memory was 42.4MB in the beginning and 92.5MB in the end (delta: -50.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-02-06 17:22:00,245 INFO L158 Benchmark]: TraceAbstraction took 1649.05ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 91.7MB in the beginning and 258.6MB in the end (delta: -166.8MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2025-02-06 17:22:00,245 INFO L158 Benchmark]: Witness Printer took 75.72ms. Allocated memory is still 402.7MB. Free memory was 258.6MB in the beginning and 251.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:22:00,246 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 793.13ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 47.4MB in the end (delta: 62.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.94ms. Allocated memory is still 142.6MB. Free memory was 47.4MB in the beginning and 44.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.11ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 42.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 380.35ms. Allocated memory is still 142.6MB. Free memory was 42.4MB in the beginning and 92.5MB in the end (delta: -50.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1649.05ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 91.7MB in the beginning and 258.6MB in the end (delta: -166.8MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * Witness Printer took 75.72ms. Allocated memory is still 402.7MB. Free memory was 258.6MB in the beginning and 251.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1681]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1681]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1654]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1654]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1581]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1581]: 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, 91 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 2777 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1336 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1441 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 15 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 17:22:00,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE