./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/openssl-simplified/s3_srvr_1a.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:23:33,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:23:33,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:23:33,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:23:33,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:23:33,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:23:33,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:23:33,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:23:33,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:23:33,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:23:33,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:23:33,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:23:33,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:23:33,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:23:33,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:23:33,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:23:33,295 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:23:33,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:23:33,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:23:33,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:23:33,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:23:33,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:23:33,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:23:33,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:23:33,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:23:33,299 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f [2025-02-06 13:23:33,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:23:33,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:23:33,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:23:33,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:23:33,657 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:23:33,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2025-02-06 13:23:34,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b144e6c14/1aa02b62bb0d4fadb8a224b1ad6cdeb4/FLAG488924bb8 [2025-02-06 13:23:35,101 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:23:35,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2025-02-06 13:23:35,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b144e6c14/1aa02b62bb0d4fadb8a224b1ad6cdeb4/FLAG488924bb8 [2025-02-06 13:23:35,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b144e6c14/1aa02b62bb0d4fadb8a224b1ad6cdeb4 [2025-02-06 13:23:35,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:23:35,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:23:35,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:23:35,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:23:35,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:23:35,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ed43b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35, skipping insertion in model container [2025-02-06 13:23:35,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:23:35,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:23:35,531 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:23:35,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:23:35,562 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:23:35,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35 WrapperNode [2025-02-06 13:23:35,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:23:35,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:23:35,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:23:35,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:23:35,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,585 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 147 [2025-02-06 13:23:35,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:23:35,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:23:35,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:23:35,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:23:35,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,607 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:23:35,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:23:35,614 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:23:35,614 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:23:35,614 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:23:35,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (1/1) ... [2025-02-06 13:23:35,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:23:35,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:23:35,637 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 13:23:35,642 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 13:23:35,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:23:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:23:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:23:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:23:35,721 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:23:35,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:23:35,925 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-06 13:23:35,925 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:23:35,936 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:23:35,936 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:23:35,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:23:35 BoogieIcfgContainer [2025-02-06 13:23:35,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:23:35,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:23:35,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:23:35,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:23:35,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:23:35" (1/3) ... [2025-02-06 13:23:35,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f64838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:23:35, skipping insertion in model container [2025-02-06 13:23:35,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:23:35" (2/3) ... [2025-02-06 13:23:35,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f64838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:23:35, skipping insertion in model container [2025-02-06 13:23:35,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:23:35" (3/3) ... [2025-02-06 13:23:35,949 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2025-02-06 13:23:35,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:23:35,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_1a.cil.c that has 1 procedures, 59 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-02-06 13:23:36,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:23:36,022 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;@7af73d15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:23:36,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 13:23:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 58 states have internal predecessors, (87), 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 13:23:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:23:36,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:36,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:36,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:23:36,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash -296794370, now seen corresponding path program 1 times [2025-02-06 13:23:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:36,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547999526] [2025-02-06 13:23:36,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:36,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:23:36,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:23:36,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:36,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:36,216 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 13:23:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547999526] [2025-02-06 13:23:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547999526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:23:36,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650655180] [2025-02-06 13:23:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:36,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:23:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:36,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:23:36,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:23:36,237 INFO L87 Difference]: Start difference. First operand has 59 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 58 states have internal predecessors, (87), 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13:23:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:36,333 INFO L93 Difference]: Finished difference Result 119 states and 178 transitions. [2025-02-06 13:23:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:23:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-02-06 13:23:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:36,344 INFO L225 Difference]: With dead ends: 119 [2025-02-06 13:23:36,344 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 13:23:36,350 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 13:23:36,356 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:36,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:23:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 13:23:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 13:23:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 56 states have internal predecessors, (80), 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 13:23:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2025-02-06 13:23:36,408 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 10 [2025-02-06 13:23:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:36,408 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2025-02-06 13:23:36,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13:23:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2025-02-06 13:23:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:23:36,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:36,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:36,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:23:36,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:23:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1684668406, now seen corresponding path program 1 times [2025-02-06 13:23:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693617097] [2025-02-06 13:23:36,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:36,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:23:36,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:23:36,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:36,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:23:36,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693617097] [2025-02-06 13:23:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693617097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:36,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:23:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884714287] [2025-02-06 13:23:36,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:36,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:23:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:36,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:23:36,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:23:36,488 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 13:23:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:36,585 INFO L93 Difference]: Finished difference Result 117 states and 165 transitions. [2025-02-06 13:23:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:23:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2025-02-06 13:23:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:36,586 INFO L225 Difference]: With dead ends: 117 [2025-02-06 13:23:36,586 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 13:23:36,587 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 13:23:36,587 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:36,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:23:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 13:23:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 13:23:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 61 states have internal predecessors, (85), 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 13:23:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-02-06 13:23:36,591 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 16 [2025-02-06 13:23:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:36,591 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-02-06 13:23:36,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 13:23:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-02-06 13:23:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 13:23:36,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:36,592 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:36,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:23:36,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:23:36,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1658629841, now seen corresponding path program 1 times [2025-02-06 13:23:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:36,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708392461] [2025-02-06 13:23:36,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:36,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:23:36,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:23:36,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:36,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:23:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708392461] [2025-02-06 13:23:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708392461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:36,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:23:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105648260] [2025-02-06 13:23:36,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:36,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:23:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:36,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:23:36,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:23:36,646 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 13:23:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:36,705 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2025-02-06 13:23:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:23:36,706 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), 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) Word has length 23 [2025-02-06 13:23:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:36,706 INFO L225 Difference]: With dead ends: 128 [2025-02-06 13:23:36,710 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 13:23:36,710 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 13:23:36,711 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:36,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:23:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 13:23:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 13:23:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.467741935483871) internal successors, (91), 67 states have internal predecessors, (91), 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 13:23:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2025-02-06 13:23:36,722 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 23 [2025-02-06 13:23:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:36,722 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2025-02-06 13:23:36,723 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), 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 13:23:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2025-02-06 13:23:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 13:23:36,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:36,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:36,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:23:36,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:23:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1855143346, now seen corresponding path program 1 times [2025-02-06 13:23:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076086244] [2025-02-06 13:23:36,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:36,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:23:36,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:23:36,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:36,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:23:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:36,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076086244] [2025-02-06 13:23:36,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076086244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:36,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:23:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910289599] [2025-02-06 13:23:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:23:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:36,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:23:36,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:23:36,808 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 13:23:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:36,904 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2025-02-06 13:23:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:23:36,904 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), 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) Word has length 23 [2025-02-06 13:23:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:36,909 INFO L225 Difference]: With dead ends: 149 [2025-02-06 13:23:36,909 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 13:23:36,909 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 13:23:36,910 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:36,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:23:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 13:23:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-06 13:23:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 80 states have internal predecessors, (104), 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 13:23:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2025-02-06 13:23:36,915 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 23 [2025-02-06 13:23:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:36,915 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2025-02-06 13:23:36,915 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), 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 13:23:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2025-02-06 13:23:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 13:23:36,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:36,916 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:36,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:23:36,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:23:36,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1064725105, now seen corresponding path program 1 times [2025-02-06 13:23:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70334166] [2025-02-06 13:23:36,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:36,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:23:36,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:23:36,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:36,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:23:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70334166] [2025-02-06 13:23:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70334166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:36,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:36,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:23:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94610745] [2025-02-06 13:23:36,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:36,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:23:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:36,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:23:36,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:23:36,982 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 13:23:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:37,033 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2025-02-06 13:23:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:23:37,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 30 [2025-02-06 13:23:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:37,034 INFO L225 Difference]: With dead ends: 167 [2025-02-06 13:23:37,034 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 13:23:37,034 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 13:23:37,035 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:37,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:23:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 13:23:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 13:23:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 82 states have (on average 1.353658536585366) internal successors, (111), 87 states have internal predecessors, (111), 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 13:23:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2025-02-06 13:23:37,043 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 30 [2025-02-06 13:23:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:37,043 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2025-02-06 13:23:37,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 13:23:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2025-02-06 13:23:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 13:23:37,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:37,044 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:37,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:23:37,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:23:37,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash 123629478, now seen corresponding path program 1 times [2025-02-06 13:23:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373722002] [2025-02-06 13:23:37,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:37,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 13:23:37,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 13:23:37,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:37,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 13:23:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:37,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373722002] [2025-02-06 13:23:37,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373722002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:37,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:37,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:23:37,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774563768] [2025-02-06 13:23:37,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:37,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:23:37,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:37,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:23:37,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:23:37,137 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 13:23:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:37,163 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2025-02-06 13:23:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:23:37,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 38 [2025-02-06 13:23:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:37,165 INFO L225 Difference]: With dead ends: 88 [2025-02-06 13:23:37,165 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 13:23:37,166 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 13:23:37,166 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 50 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:37,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 59 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:23:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 13:23:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-06 13:23:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 84 states have internal predecessors, (108), 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 13:23:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2025-02-06 13:23:37,173 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 38 [2025-02-06 13:23:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:37,173 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2025-02-06 13:23:37,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 13:23:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2025-02-06 13:23:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 13:23:37,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:37,174 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:23:37,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 13:23:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -462453438, now seen corresponding path program 1 times [2025-02-06 13:23:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:37,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532451206] [2025-02-06 13:23:37,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:37,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 13:23:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 13:23:37,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:37,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:23:37,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:23:37,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 13:23:37,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 13:23:37,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:37,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:23:37,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:23:37,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:23:37,284 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 13:23:37,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 13:23:37,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 13:23:37,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 13:23:37,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 13:23:37,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 13:23:37,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:23:37,288 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:37,328 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:23:37,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:23:37 BoogieIcfgContainer [2025-02-06 13:23:37,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:23:37,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:23:37,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:23:37,334 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:23:37,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:23:35" (3/4) ... [2025-02-06 13:23:37,335 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 13:23:37,395 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 29. [2025-02-06 13:23:37,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:23:37,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:23:37,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:23:37,449 INFO L158 Benchmark]: Toolchain (without parser) took 2056.12ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 105.3MB in the end (delta: 18.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-02-06 13:23:37,450 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:23:37,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.72ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 112.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:23:37,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.14ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:23:37,451 INFO L158 Benchmark]: Boogie Preprocessor took 25.86ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.0MB in the end (delta: 971.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:23:37,452 INFO L158 Benchmark]: IcfgBuilder took 323.13ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 93.8MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:23:37,452 INFO L158 Benchmark]: TraceAbstraction took 1389.60ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 112.8MB in the end (delta: -19.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:23:37,452 INFO L158 Benchmark]: Witness Printer took 115.03ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 105.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:23:37,453 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.26ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.72ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 112.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.14ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.86ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.0MB in the end (delta: 971.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 323.13ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 93.8MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1389.60ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 112.8MB in the end (delta: -19.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 115.03ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 105.3MB in the end (delta: 7.5MB). 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 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__verify_mode = __VERIFIER_nondet_int() ; [L24] int s__session__peer = __VERIFIER_nondet_int() ; [L25] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L26] int buf ; [L27] int cb ; [L28] int blastFlag ; [L29] int tmp___1; [L31] s__state = 8466 [L32] blastFlag = 0 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L41] COND TRUE s__state == 8466 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L90] COND TRUE blastFlag == 0 [L91] blastFlag = 1 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L93] s__state = 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L44] COND TRUE s__state == 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L97] COND TRUE blastFlag == 1 [L98] blastFlag = 2 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L100] COND FALSE !(\read(s__hit)) [L103] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L48] COND TRUE s__state == 8512 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L108] s__state = 8528 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L52] COND TRUE s__state == 8528 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L112] s__state = 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L34] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L52] COND FALSE !(s__state == 8528) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L56] COND TRUE s__state == 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L116] s__verify_mode + 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0] - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 611 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 435 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=5, InterpolantAutomatonStates: 18, 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, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 96/96 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-06 13:23:37,465 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)