./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_05_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_05_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 818d43b17d18724b2ec86a8e2c50679fe85dc99f14c66d62b6284f16b139e5eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 12:55:16,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 12:55:16,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 12:55:16,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 12:55:16,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 12:55:16,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 12:55:16,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 12:55:16,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 12:55:16,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 12:55:16,937 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 12:55:16,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 12:55:16,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 12:55:16,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 12:55:16,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 12:55:16,938 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 12:55:16,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 12:55:16,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 12:55:16,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 12:55:16,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 12:55:16,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 12:55:16,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:55:16,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 12:55:16,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 12:55:16,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 12:55:16,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 12:55:16,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 12:55:16,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 12:55:16,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 12:55:16,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 12:55:16,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 12:55:16,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 12:55:16,941 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 -> 818d43b17d18724b2ec86a8e2c50679fe85dc99f14c66d62b6284f16b139e5eb [2025-02-08 12:55:17,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 12:55:17,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 12:55:17,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 12:55:17,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 12:55:17,171 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 12:55:17,172 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_fscanf_sub_05_good.i [2025-02-08 12:55:18,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/285e44fa2/665d3827538b41cda38f8cf2aabad7f6/FLAG821cd5d83 [2025-02-08 12:55:18,841 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 12:55:18,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_05_good.i [2025-02-08 12:55:18,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/285e44fa2/665d3827538b41cda38f8cf2aabad7f6/FLAG821cd5d83 [2025-02-08 12:55:19,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/285e44fa2/665d3827538b41cda38f8cf2aabad7f6 [2025-02-08 12:55:19,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 12:55:19,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 12:55:19,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 12:55:19,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 12:55:19,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 12:55:19,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:19,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd1500b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19, skipping insertion in model container [2025-02-08 12:55:19,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:19,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 12:55:19,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:55:19,802 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 12:55:19,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 12:55:19,966 INFO L204 MainTranslator]: Completed translation [2025-02-08 12:55:19,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19 WrapperNode [2025-02-08 12:55:19,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 12:55:19,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 12:55:19,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 12:55:19,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 12:55:19,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:19,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,009 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 87 [2025-02-08 12:55:20,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 12:55:20,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 12:55:20,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 12:55:20,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 12:55:20,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,028 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 12:55:20,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 12:55:20,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 12:55:20,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 12:55:20,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 12:55:20,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (1/1) ... [2025-02-08 12:55:20,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 12:55:20,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 12:55:20,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 12:55:20,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 12:55:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 12:55:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 12:55:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 12:55:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 12:55:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 12:55:20,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 12:55:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 12:55:20,247 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 12:55:20,248 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 12:55:20,408 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-08 12:55:20,408 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 12:55:20,417 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 12:55:20,418 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 12:55:20,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:20 BoogieIcfgContainer [2025-02-08 12:55:20,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 12:55:20,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 12:55:20,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 12:55:20,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 12:55:20,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:55:19" (1/3) ... [2025-02-08 12:55:20,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606fb3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:20, skipping insertion in model container [2025-02-08 12:55:20,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:19" (2/3) ... [2025-02-08 12:55:20,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606fb3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:20, skipping insertion in model container [2025-02-08 12:55:20,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:20" (3/3) ... [2025-02-08 12:55:20,426 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_05_good.i [2025-02-08 12:55:20,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 12:55:20,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_sub_05_good.i that has 3 procedures, 56 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-08 12:55:20,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 12:55:20,482 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;@6f51b8f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 12:55:20,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 12:55:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.542857142857143) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 12:55:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 12:55:20,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:20,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:20,490 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-08 12:55:20,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:20,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1360940074, now seen corresponding path program 1 times [2025-02-08 12:55:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039987588] [2025-02-08 12:55:20,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:20,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 12:55:20,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 12:55:20,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:20,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:55:20,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039987588] [2025-02-08 12:55:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039987588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:20,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969655391] [2025-02-08 12:55:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:20,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:20,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:20,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:20,680 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.542857142857143) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:55:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:20,725 INFO L93 Difference]: Finished difference Result 103 states and 136 transitions. [2025-02-08 12:55:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 12:55:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:20,734 INFO L225 Difference]: With dead ends: 103 [2025-02-08 12:55:20,735 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 12:55:20,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:20,739 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:20,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 140 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 12:55:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-02-08 12:55:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 43 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 12:55:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2025-02-08 12:55:20,776 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2025-02-08 12:55:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:20,776 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2025-02-08 12:55:20,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:55:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2025-02-08 12:55:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 12:55:20,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:20,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:20,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 12:55:20,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash 760530685, now seen corresponding path program 1 times [2025-02-08 12:55:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034045861] [2025-02-08 12:55:20,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:20,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 12:55:20,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 12:55:20,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:20,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 12:55:20,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:20,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034045861] [2025-02-08 12:55:20,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034045861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691262295] [2025-02-08 12:55:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:20,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:20,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:20,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:20,904 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:55:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:20,917 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2025-02-08 12:55:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:20,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 12:55:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:20,919 INFO L225 Difference]: With dead ends: 51 [2025-02-08 12:55:20,920 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 12:55:20,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:20,921 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:20,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 110 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 12:55:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-02-08 12:55:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 42 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 12:55:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2025-02-08 12:55:20,927 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 12 [2025-02-08 12:55:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:20,927 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2025-02-08 12:55:20,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 12:55:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2025-02-08 12:55:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 12:55:20,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:20,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:20,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 12:55:20,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:20,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1587086452, now seen corresponding path program 1 times [2025-02-08 12:55:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003753167] [2025-02-08 12:55:20,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:20,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 12:55:20,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 12:55:20,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:20,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:20,976 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-08 12:55:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003753167] [2025-02-08 12:55:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003753167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:20,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:55:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254554753] [2025-02-08 12:55:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:20,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:20,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:20,978 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 12:55:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:20,988 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2025-02-08 12:55:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:20,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 19 [2025-02-08 12:55:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:20,990 INFO L225 Difference]: With dead ends: 83 [2025-02-08 12:55:20,990 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 12:55:20,990 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-08 12:55:20,991 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:20,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 12:55:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 12:55:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.393939393939394) internal successors, (46), 40 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:55:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-02-08 12:55:20,995 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 19 [2025-02-08 12:55:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-02-08 12:55:20,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 12:55:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-02-08 12:55:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 12:55:20,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:20,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 12:55:20,996 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-08 12:55:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1364478580, now seen corresponding path program 1 times [2025-02-08 12:55:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885237388] [2025-02-08 12:55:20,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:21,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 12:55:21,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 12:55:21,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:21,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:21,050 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-08 12:55:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885237388] [2025-02-08 12:55:21,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885237388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:21,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723891668] [2025-02-08 12:55:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:21,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:21,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,052 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-08 12:55:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:21,079 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-02-08 12:55:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 20 [2025-02-08 12:55:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:21,081 INFO L225 Difference]: With dead ends: 74 [2025-02-08 12:55:21,081 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 12:55:21,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,082 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:21,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 12:55:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-02-08 12:55:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 41 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:55:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-02-08 12:55:21,087 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 20 [2025-02-08 12:55:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:21,088 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-02-08 12:55:21,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-08 12:55:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-02-08 12:55:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 12:55:21,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:21,088 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:21,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 12:55:21,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:21,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 650836984, now seen corresponding path program 1 times [2025-02-08 12:55:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:21,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140381584] [2025-02-08 12:55:21,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:21,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:21,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 12:55:21,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 12:55:21,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:21,157 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-08 12:55:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140381584] [2025-02-08 12:55:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140381584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776661838] [2025-02-08 12:55:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:21,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:21,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:21,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,158 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-08 12:55:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:21,205 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2025-02-08 12:55:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2025-02-08 12:55:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:21,206 INFO L225 Difference]: With dead ends: 49 [2025-02-08 12:55:21,206 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 12:55:21,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,207 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:21,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 12:55:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-02-08 12:55:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 40 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:55:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-02-08 12:55:21,218 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 21 [2025-02-08 12:55:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:21,218 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-02-08 12:55:21,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-08 12:55:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-02-08 12:55:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 12:55:21,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:21,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:21,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 12:55:21,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:21,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:21,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1298211764, now seen corresponding path program 1 times [2025-02-08 12:55:21,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:21,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672234901] [2025-02-08 12:55:21,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:21,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:21,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 12:55:21,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 12:55:21,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:21,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:21,247 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-08 12:55:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672234901] [2025-02-08 12:55:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672234901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:21,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:21,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 12:55:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745505341] [2025-02-08 12:55:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:21,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:21,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,248 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 12:55:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:21,263 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2025-02-08 12:55:21,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:21,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 22 [2025-02-08 12:55:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:21,263 INFO L225 Difference]: With dead ends: 83 [2025-02-08 12:55:21,264 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 12:55:21,264 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-08 12:55:21,264 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:21,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 43 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 12:55:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 12:55:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:55:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-08 12:55:21,268 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2025-02-08 12:55:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:21,268 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-08 12:55:21,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 12:55:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-02-08 12:55:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 12:55:21,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:21,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:21,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 12:55:21,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:21,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2033110061, now seen corresponding path program 1 times [2025-02-08 12:55:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410567114] [2025-02-08 12:55:21,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:21,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 12:55:21,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 12:55:21,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:21,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 12:55:21,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410567114] [2025-02-08 12:55:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410567114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:21,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638540598] [2025-02-08 12:55:21,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:21,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:21,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:21,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,295 INFO L87 Difference]: Start difference. First operand 43 states and 49 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:55:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:21,303 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-02-08 12:55:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:21,304 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-02-08 12:55:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:21,304 INFO L225 Difference]: With dead ends: 43 [2025-02-08 12:55:21,304 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 12:55:21,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,305 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:21,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 86 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 12:55:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 12:55:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 35 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:55:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2025-02-08 12:55:21,308 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2025-02-08 12:55:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:21,308 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2025-02-08 12:55:21,309 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:55:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2025-02-08 12:55:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 12:55:21,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:21,309 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:21,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 12:55:21,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:21,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:21,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1398097541, now seen corresponding path program 1 times [2025-02-08 12:55:21,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:21,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800653586] [2025-02-08 12:55:21,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:21,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 12:55:21,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 12:55:21,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:21,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 12:55:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800653586] [2025-02-08 12:55:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800653586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134989709] [2025-02-08 12:55:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:21,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:21,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:21,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,335 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:55:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:21,342 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-08 12:55:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-02-08 12:55:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:21,343 INFO L225 Difference]: With dead ends: 42 [2025-02-08 12:55:21,343 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 12:55:21,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,343 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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-08 12:55:21,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:21,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 12:55:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-08 12:55:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:55:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-02-08 12:55:21,348 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2025-02-08 12:55:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:21,348 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-02-08 12:55:21,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 12:55:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-02-08 12:55:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 12:55:21,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:21,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:21,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 12:55:21,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:21,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash 673858477, now seen corresponding path program 1 times [2025-02-08 12:55:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:21,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516819335] [2025-02-08 12:55:21,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:21,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 12:55:21,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 12:55:21,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:21,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 12:55:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516819335] [2025-02-08 12:55:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516819335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:21,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452692232] [2025-02-08 12:55:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:21,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:21,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,414 INFO L87 Difference]: Start difference. First operand 41 states and 47 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 12:55:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:21,428 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-02-08 12:55:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:21,429 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-02-08 12:55:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:21,429 INFO L225 Difference]: With dead ends: 41 [2025-02-08 12:55:21,429 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 12:55:21,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,430 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:21,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 12:55:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 12:55:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.096774193548387) internal successors, (34), 33 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 12:55:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-02-08 12:55:21,437 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 38 [2025-02-08 12:55:21,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:21,437 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-08 12:55:21,437 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 12:55:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-02-08 12:55:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 12:55:21,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 12:55:21,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:21,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 12:55:21,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 12:55:21,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 12:55:21,439 INFO L85 PathProgramCache]: Analyzing trace with hash -585223712, now seen corresponding path program 1 times [2025-02-08 12:55:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 12:55:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588258819] [2025-02-08 12:55:21,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 12:55:21,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 12:55:21,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 12:55:21,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 12:55:21,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 12:55:21,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 12:55:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 12:55:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 12:55:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588258819] [2025-02-08 12:55:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588258819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 12:55:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 12:55:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 12:55:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788920361] [2025-02-08 12:55:21,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 12:55:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 12:55:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 12:55:21,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 12:55:21,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,504 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 12:55:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 12:55:21,512 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-02-08 12:55:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 12:55:21,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2025-02-08 12:55:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 12:55:21,512 INFO L225 Difference]: With dead ends: 40 [2025-02-08 12:55:21,512 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 12:55:21,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 12:55:21,513 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 12:55:21,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 12:55:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 12:55:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 12:55:21,514 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-08 12:55:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 12:55:21,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2025-02-08 12:55:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 12:55:21,514 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 12:55:21,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 12:55:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 12:55:21,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 12:55:21,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 12:55:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 12:55:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 12:55:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 12:55:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 12:55:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 12:55:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 12:55:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 12:55:21,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 12:55:21,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 12:55:21,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 12:55:21,609 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 12:55:21,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:55:21 BoogieIcfgContainer [2025-02-08 12:55:21,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 12:55:21,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 12:55:21,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 12:55:21,624 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 12:55:21,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:20" (3/4) ... [2025-02-08 12:55:21,627 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 12:55:21,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 12:55:21,635 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 12:55:21,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 12:55:21,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 12:55:21,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 12:55:21,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 12:55:21,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 12:55:21,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 12:55:21,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 12:55:21,756 INFO L158 Benchmark]: Toolchain (without parser) took 2722.82ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 46.2MB in the end (delta: 56.2MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2025-02-08 12:55:21,756 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:55:21,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 936.25ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 41.1MB in the end (delta: 61.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 12:55:21,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.43ms. Allocated memory is still 142.6MB. Free memory was 41.1MB in the beginning and 38.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:55:21,756 INFO L158 Benchmark]: Boogie Preprocessor took 27.19ms. Allocated memory is still 142.6MB. Free memory was 38.3MB in the beginning and 36.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 12:55:21,756 INFO L158 Benchmark]: IcfgBuilder took 381.28ms. Allocated memory is still 142.6MB. Free memory was 36.4MB in the beginning and 91.9MB in the end (delta: -55.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-02-08 12:55:21,757 INFO L158 Benchmark]: TraceAbstraction took 1203.06ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 52.5MB in the end (delta: 38.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-02-08 12:55:21,757 INFO L158 Benchmark]: Witness Printer took 127.63ms. Allocated memory is still 142.6MB. Free memory was 52.5MB in the beginning and 46.2MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 12:55:21,758 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 936.25ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 41.1MB in the end (delta: 61.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.43ms. Allocated memory is still 142.6MB. Free memory was 41.1MB in the beginning and 38.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.19ms. Allocated memory is still 142.6MB. Free memory was 38.3MB in the beginning and 36.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 381.28ms. Allocated memory is still 142.6MB. Free memory was 36.4MB in the beginning and 91.9MB in the end (delta: -55.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1203.06ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 52.5MB in the end (delta: 38.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 127.63ms. Allocated memory is still 142.6MB. Free memory was 52.5MB in the beginning and 46.2MB in the end (delta: 6.2MB). 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: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1587]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: 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, 56 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 884 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 514 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 64/64 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-08 12:55:21,787 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