./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_22_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_min_postdec_22_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 ec7a0b49047ff5c05b905dcdd8f78cb997cafd8d829ad3cf6a5dee5b3edf228d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:19:28,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:19:28,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:19:28,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:19:28,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:19:28,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:19:28,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:19:28,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:19:28,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:19:28,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:19:28,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:19:28,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:19:28,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:19:28,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:19:28,347 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:19:28,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:19:28,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:19:28,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:19:28,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:19:28,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:19:28,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:19:28,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:19:28,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:19:28,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:19:28,349 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 -> ec7a0b49047ff5c05b905dcdd8f78cb997cafd8d829ad3cf6a5dee5b3edf228d [2025-02-08 13:19:28,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:19:28,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:19:28,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:19:28,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:19:28,649 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:19:28,650 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_min_postdec_22_good.i [2025-02-08 13:19:29,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af20e9a1e/9f041c3602a14ac5bcde3ceb51f24f8f/FLAGde5ef053d [2025-02-08 13:19:30,348 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:19:30,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_22_good.i [2025-02-08 13:19:30,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af20e9a1e/9f041c3602a14ac5bcde3ceb51f24f8f/FLAGde5ef053d [2025-02-08 13:19:30,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af20e9a1e/9f041c3602a14ac5bcde3ceb51f24f8f [2025-02-08 13:19:30,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:19:30,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:19:30,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:19:30,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:19:30,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:19:30,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:19:30" (1/1) ... [2025-02-08 13:19:30,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:30, skipping insertion in model container [2025-02-08 13:19:30,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:19:30" (1/1) ... [2025-02-08 13:19:30,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:19:31,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:19:31,193 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:19:31,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:19:31,361 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:19:31,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31 WrapperNode [2025-02-08 13:19:31,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:19:31,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:19:31,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:19:31,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:19:31,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,415 INFO L138 Inliner]: procedures = 503, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 82 [2025-02-08 13:19:31,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:19:31,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:19:31,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:19:31,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:19:31,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,434 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 13:19:31,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:19:31,452 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:19:31,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:19:31,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:19:31,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (1/1) ... [2025-02-08 13:19:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:19:31,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:19:31,485 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 13:19:31,495 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 13:19:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-02-08 13:19:31,513 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-02-08 13:19:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-02-08 13:19:31,514 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-02-08 13:19:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:19:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:19:31,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:19:31,609 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:19:31,610 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:19:31,715 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-08 13:19:31,715 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:19:31,721 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:19:31,721 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:19:31,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:19:31 BoogieIcfgContainer [2025-02-08 13:19:31,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:19:31,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:19:31,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:19:31,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:19:31,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:19:30" (1/3) ... [2025-02-08 13:19:31,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c14f83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:19:31, skipping insertion in model container [2025-02-08 13:19:31,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:31" (2/3) ... [2025-02-08 13:19:31,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c14f83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:19:31, skipping insertion in model container [2025-02-08 13:19:31,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:19:31" (3/3) ... [2025-02-08 13:19:31,728 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_postdec_22_good.i [2025-02-08 13:19:31,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:19:31,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_min_postdec_22_good.i that has 3 procedures, 43 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-08 13:19:31,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:19:31,815 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;@3bec5a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:19:31,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:19:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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 13:19:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 13:19:31,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:19:31,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:19:31,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:19:31,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:19:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash 702438343, now seen corresponding path program 1 times [2025-02-08 13:19:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:19:31,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041646139] [2025-02-08 13:19:31,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:19:31,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 13:19:31,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 13:19:31,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:31,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:32,078 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 13:19:32,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:19:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041646139] [2025-02-08 13:19:32,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041646139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:19:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:19:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:19:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929032798] [2025-02-08 13:19:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:19:32,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:19:32,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:19:32,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:19:32,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:19:32,100 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 13:19:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:19:32,117 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2025-02-08 13:19:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:19:32,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2025-02-08 13:19:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:19:32,121 INFO L225 Difference]: With dead ends: 74 [2025-02-08 13:19:32,121 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 13:19:32,123 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 13:19:32,124 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:19:32,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:19:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 13:19:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-02-08 13:19:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 13:19:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-08 13:19:32,145 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 10 [2025-02-08 13:19:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:19:32,146 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-08 13:19:32,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 13:19:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-08 13:19:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 13:19:32,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:19:32,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:19:32,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:19:32,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:19:32,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:19:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1947448226, now seen corresponding path program 1 times [2025-02-08 13:19:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:19:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180058702] [2025-02-08 13:19:32,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:19:32,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 13:19:32,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 13:19:32,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:32,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:32,181 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 13:19:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:19:32,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180058702] [2025-02-08 13:19:32,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180058702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:19:32,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:19:32,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:19:32,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469619387] [2025-02-08 13:19:32,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:19:32,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:19:32,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:19:32,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:19:32,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:19:32,184 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13:19:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:19:32,197 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-02-08 13:19:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:19:32,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 17 [2025-02-08 13:19:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:19:32,198 INFO L225 Difference]: With dead ends: 53 [2025-02-08 13:19:32,198 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 13:19:32,198 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 13:19:32,199 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:19:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:19:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 13:19:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 13:19:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:19:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-02-08 13:19:32,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2025-02-08 13:19:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:19:32,202 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-08 13:19:32,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13:19:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-02-08 13:19:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 13:19:32,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:19:32,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:19:32,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:19:32,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:19:32,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:19:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2133325454, now seen corresponding path program 1 times [2025-02-08 13:19:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:19:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969011852] [2025-02-08 13:19:32,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:19:32,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 13:19:32,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 13:19:32,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:32,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:32,262 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 13:19:32,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:19:32,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969011852] [2025-02-08 13:19:32,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969011852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:19:32,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:19:32,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:19:32,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791972446] [2025-02-08 13:19:32,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:19:32,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:19:32,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:19:32,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:19:32,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:19:32,264 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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 13:19:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:19:32,279 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-02-08 13:19:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:19:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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 18 [2025-02-08 13:19:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:19:32,280 INFO L225 Difference]: With dead ends: 29 [2025-02-08 13:19:32,280 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 13:19:32,281 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 13:19:32,281 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:19:32,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:19:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 13:19:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-08 13:19:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 13:19:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-02-08 13:19:32,288 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2025-02-08 13:19:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:19:32,288 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-02-08 13:19:32,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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 13:19:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-02-08 13:19:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 13:19:32,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:19:32,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:19:32,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:19:32,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:19:32,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:19:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1708579624, now seen corresponding path program 1 times [2025-02-08 13:19:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:19:32,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054169393] [2025-02-08 13:19:32,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:19:32,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:19:32,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:19:32,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:32,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:32,381 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 13:19:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:19:32,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054169393] [2025-02-08 13:19:32,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054169393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:19:32,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:19:32,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:19:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122580125] [2025-02-08 13:19:32,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:19:32,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:19:32,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:19:32,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:19:32,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:19:32,382 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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 13:19:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:19:32,397 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-02-08 13:19:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:19:32,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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 19 [2025-02-08 13:19:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:19:32,399 INFO L225 Difference]: With dead ends: 35 [2025-02-08 13:19:32,399 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 13:19:32,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:19:32,400 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 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 13:19:32,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:19:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 13:19:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-02-08 13:19:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:19:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-02-08 13:19:32,407 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 19 [2025-02-08 13:19:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:19:32,407 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-08 13:19:32,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (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 13:19:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-02-08 13:19:32,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 13:19:32,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:19:32,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:19:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:19:32,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:19:32,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:19:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1708602464, now seen corresponding path program 1 times [2025-02-08 13:19:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:19:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960686737] [2025-02-08 13:19:32,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:19:32,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:19:32,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:19:32,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:32,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:19:32,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:19:32,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960686737] [2025-02-08 13:19:32,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960686737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:19:32,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98426221] [2025-02-08 13:19:32,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:32,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:19:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:19:32,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:19:32,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:19:32,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 13:19:32,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 13:19:32,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:32,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:32,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:19:32,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:19:32,619 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 13:19:32,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:19:32,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98426221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:19:32,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:19:32,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-08 13:19:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309374327] [2025-02-08 13:19:32,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:19:32,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:19:32,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:19:32,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:19:32,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:19:32,620 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13:19:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:19:32,625 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-02-08 13:19:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:19:32,625 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), 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 19 [2025-02-08 13:19:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:19:32,626 INFO L225 Difference]: With dead ends: 30 [2025-02-08 13:19:32,626 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 13:19:32,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:19:32,627 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 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 13:19:32,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:19:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 13:19:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 13:19:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:19:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-02-08 13:19:32,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2025-02-08 13:19:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:19:32,630 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-02-08 13:19:32,630 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), 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 13:19:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-02-08 13:19:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 13:19:32,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:19:32,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:19:32,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:19:32,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:19:32,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:19:32,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:19:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash -837273769, now seen corresponding path program 1 times [2025-02-08 13:19:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:19:32,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804128560] [2025-02-08 13:19:32,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:19:32,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 13:19:32,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 13:19:32,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:32,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:32,944 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 13:19:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:19:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804128560] [2025-02-08 13:19:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804128560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:19:32,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:19:32,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:19:32,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014260850] [2025-02-08 13:19:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:19:32,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:19:32,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:19:32,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:19:32,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:19:32,945 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13:19:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:19:32,959 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-02-08 13:19:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:19:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 25 [2025-02-08 13:19:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:19:32,960 INFO L225 Difference]: With dead ends: 24 [2025-02-08 13:19:32,960 INFO L226 Difference]: Without dead ends: 23 [2025-02-08 13:19:32,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:19:32,961 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:19:32,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:19:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-08 13:19:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-08 13:19:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:19:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-02-08 13:19:32,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 25 [2025-02-08 13:19:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:19:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-02-08 13:19:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13:19:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-02-08 13:19:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:19:32,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:19:32,968 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] [2025-02-08 13:19:32,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:19:32,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:19:32,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:19:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash -185683082, now seen corresponding path program 1 times [2025-02-08 13:19:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:19:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021744325] [2025-02-08 13:19:32,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:19:32,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:19:32,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:19:32,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:19:32,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:19:32,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:19:33,047 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 13:19:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:19:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021744325] [2025-02-08 13:19:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021744325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:19:33,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:19:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:19:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499666997] [2025-02-08 13:19:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:19:33,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:19:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:19:33,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:19:33,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:19:33,050 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 13:19:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:19:33,064 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-02-08 13:19:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:19:33,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 26 [2025-02-08 13:19:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:19:33,065 INFO L225 Difference]: With dead ends: 23 [2025-02-08 13:19:33,065 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 13:19:33,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:19:33,066 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 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 13:19:33,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:19:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 13:19:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 13:19:33,066 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 13:19:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 13:19:33,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-02-08 13:19:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:19:33,066 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 13:19:33,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 13:19:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 13:19:33,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 13:19:33,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-08 13:19:33,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-08 13:19:33,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-08 13:19:33,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-08 13:19:33,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-08 13:19:33,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-08 13:19:33,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:19:33,074 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:19:33,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 13:19:33,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:19:33,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:19:33 BoogieIcfgContainer [2025-02-08 13:19:33,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:19:33,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:19:33,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:19:33,120 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:19:33,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:19:31" (3/4) ... [2025-02-08 13:19:33,123 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:19:33,126 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-02-08 13:19:33,126 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-02-08 13:19:33,128 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 13:19:33,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 13:19:33,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 13:19:33,130 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 13:19:33,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:19:33,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:19:33,205 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:19:33,206 INFO L158 Benchmark]: Toolchain (without parser) took 2648.47ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 100.0MB in the end (delta: 18.9MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2025-02-08 13:19:33,206 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:19:33,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 803.75ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 56.7MB in the end (delta: 62.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 13:19:33,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.23ms. Allocated memory is still 167.8MB. Free memory was 56.7MB in the beginning and 54.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:19:33,207 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 167.8MB. Free memory was 54.0MB in the beginning and 52.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:19:33,207 INFO L158 Benchmark]: IcfgBuilder took 270.00ms. Allocated memory is still 167.8MB. Free memory was 52.0MB in the beginning and 37.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 13:19:33,207 INFO L158 Benchmark]: TraceAbstraction took 1395.20ms. Allocated memory is still 167.8MB. Free memory was 36.7MB in the beginning and 106.5MB in the end (delta: -69.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:19:33,207 INFO L158 Benchmark]: Witness Printer took 85.74ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 100.0MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:19:33,208 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.48ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 803.75ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 56.7MB in the end (delta: 62.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.23ms. Allocated memory is still 167.8MB. Free memory was 56.7MB in the beginning and 54.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 167.8MB. Free memory was 54.0MB in the beginning and 52.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 270.00ms. Allocated memory is still 167.8MB. Free memory was 52.0MB in the beginning and 37.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1395.20ms. Allocated memory is still 167.8MB. Free memory was 36.7MB in the beginning and 106.5MB in the end (delta: -69.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.74ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 100.0MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1621]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1621]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: 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, 43 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 189 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 41/44 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 13:19:33,227 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