./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_fscanf_multiply_11_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 af5586910dcdb8882a212a6958171fdbfb01ac33e173c458c484ec1cc1e06b08 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:21:59,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:21:59,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:21:59,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:21:59,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:21:59,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:21:59,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:21:59,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:21:59,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:21:59,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:21:59,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:21:59,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:21:59,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:21:59,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:21:59,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:21:59,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:21:59,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:21:59,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:21:59,804 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 -> af5586910dcdb8882a212a6958171fdbfb01ac33e173c458c484ec1cc1e06b08 [2025-03-09 05:22:00,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:22:00,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:22:00,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:22:00,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:22:00,064 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:22:00,065 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_fscanf_multiply_11_good.i [2025-03-09 05:22:01,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0599fa2/26d9f711cc1b4f87b12928d25ced3182/FLAGd091355ff [2025-03-09 05:22:01,606 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:22:01,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_11_good.i [2025-03-09 05:22:01,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0599fa2/26d9f711cc1b4f87b12928d25ced3182/FLAGd091355ff [2025-03-09 05:22:01,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0599fa2/26d9f711cc1b4f87b12928d25ced3182 [2025-03-09 05:22:01,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:22:01,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:22:01,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:22:01,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:22:01,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:22:01,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:22:01" (1/1) ... [2025-03-09 05:22:01,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f08395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:01, skipping insertion in model container [2025-03-09 05:22:01,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:22:01" (1/1) ... [2025-03-09 05:22:01,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:22:02,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:22:02,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:22:02,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:22:02,492 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:22:02,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02 WrapperNode [2025-03-09 05:22:02,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:22:02,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:22:02,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:22:02,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:22:02,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,529 INFO L138 Inliner]: procedures = 501, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2025-03-09 05:22:02,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:22:02,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:22:02,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:22:02,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:22:02,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,542 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 05:22:02,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:22:02,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:22:02,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:22:02,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:22:02,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (1/1) ... [2025-03-09 05:22:02,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:22:02,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:02,598 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-09 05:22:02,599 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-09 05:22:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 05:22:02,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 05:22:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 05:22:02,618 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 05:22:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2025-03-09 05:22:02,618 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2025-03-09 05:22:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:22:02,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:22:02,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:22:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2025-03-09 05:22:02,630 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2025-03-09 05:22:02,737 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:22:02,739 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:22:02,914 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-09 05:22:02,914 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:22:02,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:22:02,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:22:02,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:22:02 BoogieIcfgContainer [2025-03-09 05:22:02,924 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:22:02,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:22:02,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:22:02,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:22:02,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:22:01" (1/3) ... [2025-03-09 05:22:02,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661cbd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:22:02, skipping insertion in model container [2025-03-09 05:22:02,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:22:02" (2/3) ... [2025-03-09 05:22:02,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661cbd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:22:02, skipping insertion in model container [2025-03-09 05:22:02,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:22:02" (3/3) ... [2025-03-09 05:22:02,933 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_multiply_11_good.i [2025-03-09 05:22:02,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:22:02,951 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_fscanf_multiply_11_good.i that has 5 procedures, 85 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 05:22:03,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:22:03,011 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;@374bb491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:22:03,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 05:22:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 66 states have internal predecessors, (77), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:22:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 05:22:03,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:03,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:03,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:03,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:03,026 INFO L85 PathProgramCache]: Analyzing trace with hash 573373272, now seen corresponding path program 1 times [2025-03-09 05:22:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:03,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444662006] [2025-03-09 05:22:03,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:03,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 05:22:03,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 05:22:03,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:03,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:03,219 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-09 05:22:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444662006] [2025-03-09 05:22:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444662006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:03,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:03,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934247446] [2025-03-09 05:22:03,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:03,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:03,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:03,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:03,241 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 66 states have internal predecessors, (77), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:22:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:03,290 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2025-03-09 05:22:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-09 05:22:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:03,297 INFO L225 Difference]: With dead ends: 158 [2025-03-09 05:22:03,298 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:22:03,301 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-09 05:22:03,303 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:03,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 208 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:22:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-03-09 05:22:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 62 states have internal predecessors, (73), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:22:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2025-03-09 05:22:03,344 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 23 [2025-03-09 05:22:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:03,345 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2025-03-09 05:22:03,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 05:22:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2025-03-09 05:22:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 05:22:03,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:03,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:03,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:22:03,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:03,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash 594702291, now seen corresponding path program 1 times [2025-03-09 05:22:03,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:03,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118014290] [2025-03-09 05:22:03,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:03,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:03,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 05:22:03,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 05:22:03,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:03,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:03,427 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-09 05:22:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118014290] [2025-03-09 05:22:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118014290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:03,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:03,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:03,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334858202] [2025-03-09 05:22:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:03,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:03,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:03,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:03,430 INFO L87 Difference]: Start difference. First operand 80 states and 107 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, (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-03-09 05:22:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:03,453 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2025-03-09 05:22:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:03,454 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, (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 24 [2025-03-09 05:22:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:03,455 INFO L225 Difference]: With dead ends: 80 [2025-03-09 05:22:03,455 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 05:22:03,455 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-09 05:22:03,455 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:03,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 05:22:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-09 05:22:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 61 states have internal predecessors, (72), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:22:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2025-03-09 05:22:03,465 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 24 [2025-03-09 05:22:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:03,465 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2025-03-09 05:22:03,465 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, (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-03-09 05:22:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2025-03-09 05:22:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 05:22:03,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:03,470 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:03,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 05:22:03,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1677733523, now seen corresponding path program 1 times [2025-03-09 05:22:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:03,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922278534] [2025-03-09 05:22:03,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:03,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 05:22:03,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 05:22:03,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 05:22:03,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922278534] [2025-03-09 05:22:03,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922278534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:03,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:03,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:03,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206351802] [2025-03-09 05:22:03,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:03,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:03,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:03,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:03,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:03,553 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 05:22:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:03,587 INFO L93 Difference]: Finished difference Result 126 states and 164 transitions. [2025-03-09 05:22:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:03,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2025-03-09 05:22:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:03,589 INFO L225 Difference]: With dead ends: 126 [2025-03-09 05:22:03,589 INFO L226 Difference]: Without dead ends: 84 [2025-03-09 05:22:03,589 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-09 05:22:03,589 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:03,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 177 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-09 05:22:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-03-09 05:22:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.375) internal successors, (77), 64 states have internal predecessors, (77), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:22:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-03-09 05:22:03,596 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 37 [2025-03-09 05:22:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:03,596 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-03-09 05:22:03,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 05:22:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-03-09 05:22:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 05:22:03,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:03,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:03,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:22:03,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:03,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash 470131682, now seen corresponding path program 1 times [2025-03-09 05:22:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34954357] [2025-03-09 05:22:03,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:03,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 05:22:03,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 05:22:03,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:03,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 05:22:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34954357] [2025-03-09 05:22:03,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34954357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:03,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:22:03,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:22:03,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105345953] [2025-03-09 05:22:03,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:03,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:03,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:03,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:03,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:22:03,660 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 05:22:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:03,703 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2025-03-09 05:22:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2025-03-09 05:22:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:03,704 INFO L225 Difference]: With dead ends: 83 [2025-03-09 05:22:03,705 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:22:03,706 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-09 05:22:03,706 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 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-09 05:22:03,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:22:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-09 05:22:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 63 states have internal predecessors, (76), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:22:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-03-09 05:22:03,719 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 38 [2025-03-09 05:22:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:03,719 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-03-09 05:22:03,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 05:22:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-03-09 05:22:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:22:03,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:03,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:03,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 05:22:03,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:03,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash 357449062, now seen corresponding path program 1 times [2025-03-09 05:22:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:03,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416427660] [2025-03-09 05:22:03,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:03,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:22:03,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:22:03,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:03,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:22:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:03,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416427660] [2025-03-09 05:22:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416427660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:03,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311383483] [2025-03-09 05:22:03,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:03,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:03,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:03,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:03,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:22:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:22:03,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:22:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:03,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:22:03,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 05:22:03,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:03,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311383483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:03,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:03,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:22:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174297619] [2025-03-09 05:22:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:03,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:03,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:03,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:03,914 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 05:22:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:03,928 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2025-03-09 05:22:03,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2025-03-09 05:22:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:03,929 INFO L225 Difference]: With dead ends: 83 [2025-03-09 05:22:03,929 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:22:03,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:03,930 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:03,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:22:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-09 05:22:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 62 states have internal predecessors, (75), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:22:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2025-03-09 05:22:03,940 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 49 [2025-03-09 05:22:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:03,940 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2025-03-09 05:22:03,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 05:22:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2025-03-09 05:22:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:22:03,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:03,941 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:03,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:22:04,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:04,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:04,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1803980963, now seen corresponding path program 1 times [2025-03-09 05:22:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340653140] [2025-03-09 05:22:04,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:04,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:22:04,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:22:04,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:04,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:22:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340653140] [2025-03-09 05:22:04,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340653140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836194483] [2025-03-09 05:22:04,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:04,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:04,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:04,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:04,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:22:04,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:22:04,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:22:04,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:04,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:04,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:22:04,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 05:22:04,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836194483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:04,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:22:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415391835] [2025-03-09 05:22:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:04,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:04,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:04,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:04,322 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 05:22:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:04,343 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2025-03-09 05:22:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:04,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2025-03-09 05:22:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:04,345 INFO L225 Difference]: With dead ends: 104 [2025-03-09 05:22:04,345 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 05:22:04,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:04,345 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:04,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 179 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 05:22:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-09 05:22:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 66 states have internal predecessors, (81), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 05:22:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-03-09 05:22:04,357 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 50 [2025-03-09 05:22:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:04,357 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-03-09 05:22:04,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 05:22:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-03-09 05:22:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:22:04,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:04,360 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:04,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:22:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 05:22:04,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:04,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1780827610, now seen corresponding path program 1 times [2025-03-09 05:22:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537077177] [2025-03-09 05:22:04,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:04,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:22:04,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:22:04,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:04,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 05:22:04,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537077177] [2025-03-09 05:22:04,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537077177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:04,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915939395] [2025-03-09 05:22:04,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:04,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:04,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:04,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:04,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:22:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:22:04,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:22:04,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:04,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:04,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:22:04,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 05:22:04,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:04,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915939395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:04,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:04,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-09 05:22:04,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472123838] [2025-03-09 05:22:04,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:04,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:04,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:04,737 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 05:22:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:04,751 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2025-03-09 05:22:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:04,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-09 05:22:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:04,753 INFO L225 Difference]: With dead ends: 108 [2025-03-09 05:22:04,753 INFO L226 Difference]: Without dead ends: 85 [2025-03-09 05:22:04,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:04,754 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 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-03-09 05:22:04,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-09 05:22:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-09 05:22:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 05:22:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2025-03-09 05:22:04,764 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 55 [2025-03-09 05:22:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:04,765 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2025-03-09 05:22:04,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 05:22:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2025-03-09 05:22:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 05:22:04,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:04,769 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:04,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 05:22:04,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:04,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:04,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1093030895, now seen corresponding path program 1 times [2025-03-09 05:22:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:04,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864251761] [2025-03-09 05:22:04,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:04,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:22:04,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:22:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:04,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-09 05:22:05,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864251761] [2025-03-09 05:22:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864251761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170784271] [2025-03-09 05:22:05,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:05,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:05,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:05,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:05,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:22:05,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:22:05,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:22:05,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:05,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:05,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:22:05,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 05:22:05,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170784271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:05,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:22:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070967488] [2025-03-09 05:22:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:05,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:05,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:05,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:05,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:05,097 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:22:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:05,105 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2025-03-09 05:22:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-03-09 05:22:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:05,106 INFO L225 Difference]: With dead ends: 84 [2025-03-09 05:22:05,106 INFO L226 Difference]: Without dead ends: 83 [2025-03-09 05:22:05,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:05,107 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:05,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 172 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-09 05:22:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-09 05:22:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 62 states have internal predecessors, (76), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 05:22:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2025-03-09 05:22:05,112 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 62 [2025-03-09 05:22:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:05,112 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-03-09 05:22:05,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:22:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2025-03-09 05:22:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:22:05,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:05,113 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:05,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 05:22:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:05,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:05,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash 475780609, now seen corresponding path program 1 times [2025-03-09 05:22:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47310193] [2025-03-09 05:22:05,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 05:22:05,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 05:22:05,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:05,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-09 05:22:05,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:05,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47310193] [2025-03-09 05:22:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47310193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929013589] [2025-03-09 05:22:05,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:05,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:05,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:05,381 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:05,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 05:22:05,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 05:22:05,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 05:22:05,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:05,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:05,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:22:05,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 05:22:05,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929013589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:05,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:05,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:22:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269398329] [2025-03-09 05:22:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:05,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:05,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:05,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:05,465 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:22:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:05,478 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2025-03-09 05:22:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:05,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2025-03-09 05:22:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:05,479 INFO L225 Difference]: With dead ends: 90 [2025-03-09 05:22:05,479 INFO L226 Difference]: Without dead ends: 83 [2025-03-09 05:22:05,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:05,480 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:05,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-09 05:22:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-09 05:22:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.271186440677966) internal successors, (75), 62 states have internal predecessors, (75), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 05:22:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 113 transitions. [2025-03-09 05:22:05,489 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 113 transitions. Word has length 63 [2025-03-09 05:22:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:05,489 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 113 transitions. [2025-03-09 05:22:05,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:22:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 113 transitions. [2025-03-09 05:22:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:22:05,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:22:05,493 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:05,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 05:22:05,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:05,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:22:05,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:22:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash 279267104, now seen corresponding path program 1 times [2025-03-09 05:22:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:22:05,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744271551] [2025-03-09 05:22:05,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:22:05,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 05:22:05,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 05:22:05,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:05,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-09 05:22:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:22:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744271551] [2025-03-09 05:22:05,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744271551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:22:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641734408] [2025-03-09 05:22:05,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:22:05,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:05,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:22:05,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:22:05,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:22:05,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 05:22:05,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 05:22:05,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:22:05,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:22:05,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:22:05,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:22:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 05:22:05,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:22:05,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641734408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:22:05,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:22:05,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-09 05:22:05,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375013500] [2025-03-09 05:22:05,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:22:05,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:22:05,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:22:05,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:22:05,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:05,824 INFO L87 Difference]: Start difference. First operand 83 states and 113 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:22:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:22:05,827 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2025-03-09 05:22:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:22:05,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2025-03-09 05:22:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:22:05,828 INFO L225 Difference]: With dead ends: 83 [2025-03-09 05:22:05,828 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 05:22:05,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:22:05,829 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:22:05,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:22:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 05:22:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 05:22:05,829 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-09 05:22:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 05:22:05,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2025-03-09 05:22:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:22:05,830 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 05:22:05,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:22:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 05:22:05,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 05:22:05,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 05:22:05,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 05:22:05,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 05:22:05,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 05:22:05,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 05:22:05,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 05:22:05,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 05:22:05,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 05:22:05,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 05:22:06,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:22:06,035 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:22:06,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 05:22:06,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:22:06,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:22:06 BoogieIcfgContainer [2025-03-09 05:22:06,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:22:06,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:22:06,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:22:06,081 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:22:06,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:22:02" (3/4) ... [2025-03-09 05:22:06,083 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 05:22:06,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 05:22:06,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2025-03-09 05:22:06,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 05:22:06,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2025-03-09 05:22:06,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 05:22:06,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-09 05:22:06,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 05:22:06,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 05:22:06,154 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 05:22:06,154 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 05:22:06,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:22:06,155 INFO L158 Benchmark]: Toolchain (without parser) took 4495.19ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 78.2MB in the end (delta: 33.0MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2025-03-09 05:22:06,155 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:22:06,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 831.68ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 50.1MB in the end (delta: 60.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 05:22:06,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 47.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:22:06,156 INFO L158 Benchmark]: Boogie Preprocessor took 19.64ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 45.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:22:06,156 INFO L158 Benchmark]: IcfgBuilder took 374.27ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 99.4MB in the end (delta: -53.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2025-03-09 05:22:06,156 INFO L158 Benchmark]: TraceAbstraction took 3153.27ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 85.0MB in the end (delta: 13.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2025-03-09 05:22:06,156 INFO L158 Benchmark]: Witness Printer took 73.45ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 78.2MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:22:06,157 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.32ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 831.68ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 50.1MB in the end (delta: 60.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 47.5MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.64ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 45.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 374.27ms. Allocated memory is still 142.6MB. Free memory was 45.8MB in the beginning and 99.4MB in the end (delta: -53.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3153.27ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 85.0MB in the end (delta: 13.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 73.45ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 78.2MB in the end (delta: 6.8MB). 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: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 85 locations, 131 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 1800 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 863 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 937 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=6, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 790 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1066 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 416/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 05:22:06,169 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