./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_22_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_22_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8e002edff03e85a930a4bd074978aadf43bc2fc41e1f585376197cfc6401e345 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:21:35,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:21:35,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:21:35,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:21:35,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:21:35,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:21:35,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:21:35,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:21:35,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:21:35,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:21:35,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:21:35,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:21:35,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:21:35,881 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:21:35,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:21:35,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:21:35,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e002edff03e85a930a4bd074978aadf43bc2fc41e1f585376197cfc6401e345 [2025-03-17 18:21:36,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:21:36,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:21:36,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:21:36,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:21:36,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:21:36,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_22_good.i [2025-03-17 18:21:37,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a95ec04/bf6ead6ce3c94b2eb65ca2a806012c2e/FLAGa5709655d [2025-03-17 18:21:37,572 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:21:37,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_22_good.i [2025-03-17 18:21:37,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a95ec04/bf6ead6ce3c94b2eb65ca2a806012c2e/FLAGa5709655d [2025-03-17 18:21:37,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a95ec04/bf6ead6ce3c94b2eb65ca2a806012c2e [2025-03-17 18:21:37,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:21:37,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:21:37,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:21:37,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:21:37,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:21:37,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:21:37" (1/1) ... [2025-03-17 18:21:37,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f15f21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:37, skipping insertion in model container [2025-03-17 18:21:37,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:21:37" (1/1) ... [2025-03-17 18:21:37,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:21:38,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:21:38,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:21:38,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:21:38,460 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:21:38,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38 WrapperNode [2025-03-17 18:21:38,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:21:38,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:21:38,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:21:38,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:21:38,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,507 INFO L138 Inliner]: procedures = 504, calls = 45, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 124 [2025-03-17 18:21:38,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:21:38,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:21:38,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:21:38,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:21:38,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,535 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-03-17 18:21:38,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:21:38,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:21:38,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:21:38,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:21:38,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (1/1) ... [2025-03-17 18:21:38,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:21:38,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:21:38,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 18:21:38,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 18:21:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-17 18:21:38,589 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-17 18:21:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-17 18:21:38,589 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-17 18:21:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:21:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:21:38,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:21:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 18:21:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 18:21:38,698 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:21:38,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:21:38,857 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-17 18:21:38,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:21:38,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:21:38,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:21:38,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:21:38 BoogieIcfgContainer [2025-03-17 18:21:38,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:21:38,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:21:38,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:21:38,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:21:38,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:21:37" (1/3) ... [2025-03-17 18:21:38,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4b731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:21:38, skipping insertion in model container [2025-03-17 18:21:38,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:21:38" (2/3) ... [2025-03-17 18:21:38,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf4b731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:21:38, skipping insertion in model container [2025-03-17 18:21:38,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:21:38" (3/3) ... [2025-03-17 18:21:38,876 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_22_good.i [2025-03-17 18:21:38,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:21:38,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fgets_multiply_22_good.i that has 3 procedures, 52 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 18:21:38,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:21:38,965 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;@47da3087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:21:38,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 18:21:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 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-03-17 18:21:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 18:21:38,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:21:38,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:38,975 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-03-17 18:21:38,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:21:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 679718739, now seen corresponding path program 1 times [2025-03-17 18:21:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:21:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202934728] [2025-03-17 18:21:38,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:21:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:21:39,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 18:21:39,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 18:21:39,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:21:39,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:21:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:21:39,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:21:39,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202934728] [2025-03-17 18:21:39,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202934728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:21:39,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:21:39,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:21:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137905326] [2025-03-17 18:21:39,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:21:39,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:21:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:21:39,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:21:39,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,196 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 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 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:21:39,225 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2025-03-17 18:21:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:21:39,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-17 18:21:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:21:39,231 INFO L225 Difference]: With dead ends: 52 [2025-03-17 18:21:39,232 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 18:21:39,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,235 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:21:39,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 126 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:21:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 18:21:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 18:21:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 38 states have internal predecessors, (42), 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-03-17 18:21:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2025-03-17 18:21:39,258 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 13 [2025-03-17 18:21:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:21:39,259 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2025-03-17 18:21:39,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2025-03-17 18:21:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 18:21:39,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:21:39,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:39,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:21:39,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:21:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:21:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash -403555560, now seen corresponding path program 1 times [2025-03-17 18:21:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:21:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786442285] [2025-03-17 18:21:39,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:21:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:21:39,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 18:21:39,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 18:21:39,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:21:39,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:21:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:21:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:21:39,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786442285] [2025-03-17 18:21:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786442285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:21:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:21:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:21:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188642264] [2025-03-17 18:21:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:21:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:21:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:21:39,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:21:39,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,329 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:21:39,340 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-03-17 18:21:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:21:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 18:21:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:21:39,341 INFO L225 Difference]: With dead ends: 44 [2025-03-17 18:21:39,341 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 18:21:39,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,344 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:21:39,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:21:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 18:21:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 18:21:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 37 states have internal predecessors, (41), 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-03-17 18:21:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-03-17 18:21:39,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 14 [2025-03-17 18:21:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:21:39,352 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-03-17 18:21:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-03-17 18:21:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 18:21:39,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:21:39,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:39,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 18:21:39,354 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-03-17 18:21:39,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:21:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1538006346, now seen corresponding path program 1 times [2025-03-17 18:21:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:21:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652824175] [2025-03-17 18:21:39,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:21:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:21:39,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 18:21:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 18:21:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:21:39,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:21:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:21:39,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:21:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652824175] [2025-03-17 18:21:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652824175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:21:39,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:21:39,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:21:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573591983] [2025-03-17 18:21:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:21:39,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:21:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:21:39,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:21:39,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,444 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:21:39,461 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2025-03-17 18:21:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:21:39,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-17 18:21:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:21:39,463 INFO L225 Difference]: With dead ends: 43 [2025-03-17 18:21:39,463 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 18:21:39,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,463 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:21:39,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:21:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 18:21:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-17 18:21:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 36 states have internal predecessors, (40), 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-03-17 18:21:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-17 18:21:39,468 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 18 [2025-03-17 18:21:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:21:39,468 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-17 18:21:39,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-03-17 18:21:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 18:21:39,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:21:39,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:39,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:21:39,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:21:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:21:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash 434172175, now seen corresponding path program 1 times [2025-03-17 18:21:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:21:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427813172] [2025-03-17 18:21:39,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:21:39,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:21:39,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 18:21:39,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 18:21:39,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:21:39,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:21:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:21:39,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:21:39,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427813172] [2025-03-17 18:21:39,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427813172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:21:39,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:21:39,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:21:39,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035345067] [2025-03-17 18:21:39,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:21:39,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:21:39,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:21:39,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:21:39,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,544 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:21:39,555 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2025-03-17 18:21:39,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:21:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2025-03-17 18:21:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:21:39,557 INFO L225 Difference]: With dead ends: 56 [2025-03-17 18:21:39,557 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 18:21:39,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,558 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 25 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 94 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-03-17 18:21:39,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:21:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 18:21:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 18:21:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 18:21:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-03-17 18:21:39,565 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 19 [2025-03-17 18:21:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:21:39,565 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-03-17 18:21:39,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2025-03-17 18:21:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 18:21:39,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:21:39,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:39,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 18:21:39,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 18:21:39,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:21:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash 433556462, now seen corresponding path program 1 times [2025-03-17 18:21:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:21:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866011179] [2025-03-17 18:21:39,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:21:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:21:39,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 18:21:39,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 18:21:39,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:21:39,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:21:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:21:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:21:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866011179] [2025-03-17 18:21:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866011179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:21:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:21:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:21:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965490727] [2025-03-17 18:21:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:21:39,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:21:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:21:39,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:21:39,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,620 INFO L87 Difference]: Start difference. First operand 49 states and 61 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:21:39,635 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2025-03-17 18:21:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:21:39,635 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, (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 19 [2025-03-17 18:21:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:21:39,636 INFO L225 Difference]: With dead ends: 49 [2025-03-17 18:21:39,637 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 18:21:39,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,638 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:21:39,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:21:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 18:21:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 18:21:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 18:21:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-03-17 18:21:39,660 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 19 [2025-03-17 18:21:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:21:39,660 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-03-17 18:21:39,660 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-03-17 18:21:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 18:21:39,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:21:39,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:39,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 18:21:39,661 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-03-17 18:21:39,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:21:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 556026666, now seen corresponding path program 1 times [2025-03-17 18:21:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:21:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086994182] [2025-03-17 18:21:39,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:21:39,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:21:39,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 18:21:39,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 18:21:39,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:21:39,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:21:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:21:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:21:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086994182] [2025-03-17 18:21:39,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086994182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:21:39,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:21:39,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:21:39,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677308166] [2025-03-17 18:21:39,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:21:39,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:21:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:21:39,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:21:39,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,732 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:21:39,743 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2025-03-17 18:21:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:21:39,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2025-03-17 18:21:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:21:39,744 INFO L225 Difference]: With dead ends: 48 [2025-03-17 18:21:39,744 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 18:21:39,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,746 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:21:39,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:21:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 18:21:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 18:21:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 18:21:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-03-17 18:21:39,751 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 20 [2025-03-17 18:21:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:21:39,751 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-03-17 18:21:39,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-03-17 18:21:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 18:21:39,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:21:39,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:21:39,753 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-03-17 18:21:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:21:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 56957443, now seen corresponding path program 1 times [2025-03-17 18:21:39,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:21:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241367186] [2025-03-17 18:21:39,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:21:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:21:39,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 18:21:39,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 18:21:39,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:21:39,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:21:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:21:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:21:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241367186] [2025-03-17 18:21:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241367186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:21:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:21:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:21:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612039049] [2025-03-17 18:21:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:21:39,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:21:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:21:39,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:21:39,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,800 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:21:39,808 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2025-03-17 18:21:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:21:39,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2025-03-17 18:21:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:21:39,809 INFO L225 Difference]: With dead ends: 47 [2025-03-17 18:21:39,809 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 18:21:39,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:21:39,810 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 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-03-17 18:21:39,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:21:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 18:21:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 18:21:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:21:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 18:21:39,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2025-03-17 18:21:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:21:39,810 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 18:21:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:21:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 18:21:39,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 18:21:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 18:21:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 18:21:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 18:21:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 18:21:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 18:21:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 18:21:39,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:21:39,815 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:21:39,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 18:21:39,839 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 18:21:39,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:21:39 BoogieIcfgContainer [2025-03-17 18:21:39,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 18:21:39,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 18:21:39,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 18:21:39,844 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 18:21:39,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:21:38" (3/4) ... [2025-03-17 18:21:39,845 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 18:21:39,849 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-17 18:21:39,849 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-17 18:21:39,852 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-17 18:21:39,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-17 18:21:39,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 18:21:39,854 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 18:21:39,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 18:21:39,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 18:21:39,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 18:21:39,916 INFO L158 Benchmark]: Toolchain (without parser) took 2117.62ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 92.0MB in the end (delta: 33.9MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2025-03-17 18:21:39,916 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:21:39,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.18ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 66.0MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 18:21:39,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 167.8MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:21:39,917 INFO L158 Benchmark]: Boogie Preprocessor took 33.56ms. Allocated memory is still 167.8MB. Free memory was 63.6MB in the beginning and 61.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:21:39,917 INFO L158 Benchmark]: IcfgBuilder took 324.75ms. Allocated memory is still 167.8MB. Free memory was 61.7MB in the beginning and 44.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 18:21:39,917 INFO L158 Benchmark]: TraceAbstraction took 973.88ms. Allocated memory is still 167.8MB. Free memory was 44.1MB in the beginning and 98.5MB in the end (delta: -54.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 18:21:39,918 INFO L158 Benchmark]: Witness Printer took 71.32ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 92.0MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 18:21:39,919 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.18ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 66.0MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 167.8MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.56ms. Allocated memory is still 167.8MB. Free memory was 63.6MB in the beginning and 61.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 324.75ms. Allocated memory is still 167.8MB. Free memory was 61.7MB in the beginning and 44.5MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 973.88ms. Allocated memory is still 167.8MB. Free memory was 44.1MB in the beginning and 98.5MB in the end (delta: -54.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.32ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 92.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: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 80 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 714 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 332 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 382 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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-03-17 18:21:39,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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