./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:11:44,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:11:44,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:11:44,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:11:44,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:11:44,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:11:44,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:11:44,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:11:44,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:11:44,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:11:44,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:11:44,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:11:44,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:11:44,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:11:44,656 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:11:44,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:11:44,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:11:44,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:11:44,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:11:44,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:11:44,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:11:44,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:11:44,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:11:44,659 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 [2025-03-17 15:11:44,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:11:44,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:11:44,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:11:44,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:11:44,890 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:11:44,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2025-03-17 15:11:45,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f834e46b/82ac2f9c12974363a117a5fbc92f065f/FLAG58ca67083 [2025-03-17 15:11:46,186 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:11:46,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2025-03-17 15:11:46,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f834e46b/82ac2f9c12974363a117a5fbc92f065f/FLAG58ca67083 [2025-03-17 15:11:46,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f834e46b/82ac2f9c12974363a117a5fbc92f065f [2025-03-17 15:11:46,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:11:46,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:11:46,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:11:46,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:11:46,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:11:46,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c39768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46, skipping insertion in model container [2025-03-17 15:11:46,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:11:46,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:11:46,681 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:11:46,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:11:46,706 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:11:46,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46 WrapperNode [2025-03-17 15:11:46,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:11:46,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:11:46,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:11:46,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:11:46,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,730 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-17 15:11:46,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:11:46,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:11:46,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:11:46,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:11:46,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,754 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:11:46,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:11:46,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:11:46,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:11:46,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:11:46,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (1/1) ... [2025-03-17 15:11:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:11:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:46,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:11:46,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:11:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:11:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:11:46,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:11:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:11:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:11:46,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:11:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:11:46,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:11:46,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:11:46,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:11:46,959 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 15:11:46,959 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:11:46,966 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:11:46,966 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:11:46,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:46 BoogieIcfgContainer [2025-03-17 15:11:46,967 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:11:46,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:11:46,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:11:46,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:11:46,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:11:46" (1/3) ... [2025-03-17 15:11:46,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728845c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:46, skipping insertion in model container [2025-03-17 15:11:46,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:46" (2/3) ... [2025-03-17 15:11:46,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728845c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:46, skipping insertion in model container [2025-03-17 15:11:46,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:46" (3/3) ... [2025-03-17 15:11:46,974 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2025-03-17 15:11:46,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:11:46,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_unwindbound5.i that has 3 procedures, 34 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 15:11:47,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:11:47,033 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;@4f7a8df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:11:47,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 15:11:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 27 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:11:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:11:47,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:47,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:47,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash -265482271, now seen corresponding path program 1 times [2025-03-17 15:11:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234132140] [2025-03-17 15:11:47,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:47,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:47,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:47,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:11:47,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:47,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234132140] [2025-03-17 15:11:47,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234132140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102576812] [2025-03-17 15:11:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:47,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:47,158 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-17 15:11:47,160 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-17 15:11:47,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:47,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:47,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:11:47,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:11:47,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:11:47,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102576812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:47,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:11:47,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:11:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566333752] [2025-03-17 15:11:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:47,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:11:47,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:47,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:11:47,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:11:47,246 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 27 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:11:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:47,261 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2025-03-17 15:11:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:11:47,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-17 15:11:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:47,268 INFO L225 Difference]: With dead ends: 65 [2025-03-17 15:11:47,268 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 15:11:47,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:11:47,274 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 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-17 15:11:47,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 15:11:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 15:11:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-17 15:11:47,303 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2025-03-17 15:11:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:47,303 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-17 15:11:47,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:11:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-17 15:11:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:11:47,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:47,304 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:47,310 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-17 15:11:47,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 15:11:47,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:47,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2033804479, now seen corresponding path program 1 times [2025-03-17 15:11:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:47,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448067243] [2025-03-17 15:11:47,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:47,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:47,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:47,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:47,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:47,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448067243] [2025-03-17 15:11:47,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448067243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:47,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:47,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:11:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514331272] [2025-03-17 15:11:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:47,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:11:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:47,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:11:47,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:11:47,594 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:47,630 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-17 15:11:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:11:47,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-03-17 15:11:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:47,631 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:11:47,632 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 15:11:47,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:11:47,633 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:47,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 15:11:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-03-17 15:11:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-17 15:11:47,639 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2025-03-17 15:11:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:47,640 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-17 15:11:47,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-17 15:11:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:11:47,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:47,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:47,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:11:47,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:47,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1376570584, now seen corresponding path program 1 times [2025-03-17 15:11:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:47,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767245640] [2025-03-17 15:11:47,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:47,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:11:47,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:11:47,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:47,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:47,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767245640] [2025-03-17 15:11:47,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767245640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:47,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:47,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:11:47,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085296627] [2025-03-17 15:11:47,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:47,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:11:47,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:47,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:11:47,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:11:47,718 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:47,749 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-17 15:11:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:47,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-17 15:11:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:47,751 INFO L225 Difference]: With dead ends: 45 [2025-03-17 15:11:47,751 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 15:11:47,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:11:47,752 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:47,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 15:11:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 15:11:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-17 15:11:47,760 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2025-03-17 15:11:47,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:47,761 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-17 15:11:47,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-17 15:11:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:11:47,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:47,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:47,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:11:47,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1297720685, now seen corresponding path program 1 times [2025-03-17 15:11:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501137881] [2025-03-17 15:11:47,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:47,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:11:47,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:11:47,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:47,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501137881] [2025-03-17 15:11:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501137881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:47,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:47,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:47,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706296462] [2025-03-17 15:11:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:47,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:11:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:47,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:11:47,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:47,856 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:47,919 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-17 15:11:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:11:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-17 15:11:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:47,920 INFO L225 Difference]: With dead ends: 31 [2025-03-17 15:11:47,920 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 15:11:47,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:11:47,920 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:47,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 59 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 15:11:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 15:11:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-17 15:11:47,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2025-03-17 15:11:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:47,924 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-17 15:11:47,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-17 15:11:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:11:47,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:47,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:47,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:11:47,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:47,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1574635590, now seen corresponding path program 1 times [2025-03-17 15:11:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057535449] [2025-03-17 15:11:47,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:47,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:47,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:47,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:48,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:48,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057535449] [2025-03-17 15:11:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057535449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:48,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410594141] [2025-03-17 15:11:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:48,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:11:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:48,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:11:48,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:48,009 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:48,070 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-03-17 15:11:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:11:48,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-17 15:11:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:48,071 INFO L225 Difference]: With dead ends: 40 [2025-03-17 15:11:48,071 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 15:11:48,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:11:48,072 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:48,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 15:11:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-03-17 15:11:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-17 15:11:48,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2025-03-17 15:11:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:48,082 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-17 15:11:48,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-17 15:11:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:11:48,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:48,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:48,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:11:48,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:48,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1574564092, now seen corresponding path program 1 times [2025-03-17 15:11:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978014571] [2025-03-17 15:11:48,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:48,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:48,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:48,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:48,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978014571] [2025-03-17 15:11:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978014571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050201480] [2025-03-17 15:11:48,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:48,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:48,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:48,170 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-17 15:11:48,172 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-17 15:11:48,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:48,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:11:48,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:48,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:11:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050201480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:48,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:11:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-17 15:11:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270110832] [2025-03-17 15:11:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:11:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:48,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:11:48,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:11:48,256 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:48,302 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-17 15:11:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-17 15:11:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:48,303 INFO L225 Difference]: With dead ends: 38 [2025-03-17 15:11:48,303 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 15:11:48,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:11:48,305 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:48,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 15:11:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-03-17 15:11:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-17 15:11:48,310 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2025-03-17 15:11:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:48,310 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 15:11:48,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:11:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-17 15:11:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:11:48,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:48,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:48,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:11:48,515 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-17 15:11:48,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -222621797, now seen corresponding path program 1 times [2025-03-17 15:11:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270304609] [2025-03-17 15:11:48,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:48,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:11:48,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:11:48,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:48,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270304609] [2025-03-17 15:11:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270304609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608866364] [2025-03-17 15:11:48,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:48,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:48,594 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-17 15:11:48,597 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-17 15:11:48,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:11:48,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:11:48,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:48,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:48,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:11:48,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:48,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608866364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:48,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-17 15:11:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69182210] [2025-03-17 15:11:48,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:48,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:11:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:48,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:11:48,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:11:48,710 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:11:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:48,796 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-03-17 15:11:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:11:48,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 24 [2025-03-17 15:11:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:48,797 INFO L225 Difference]: With dead ends: 67 [2025-03-17 15:11:48,797 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 15:11:48,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:11:48,797 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:48,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 104 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 15:11:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-03-17 15:11:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:11:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-03-17 15:11:48,805 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2025-03-17 15:11:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:48,806 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-17 15:11:48,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:11:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-03-17 15:11:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:11:48,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:48,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:48,813 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-17 15:11:49,011 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-17 15:11:49,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:49,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1687826702, now seen corresponding path program 1 times [2025-03-17 15:11:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41112165] [2025-03-17 15:11:49,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:49,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:11:49,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:11:49,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:49,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41112165] [2025-03-17 15:11:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41112165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053335091] [2025-03-17 15:11:49,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:49,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:49,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:49,091 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-17 15:11:49,092 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-17 15:11:49,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:11:49,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:11:49,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:49,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:49,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:11:49,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:49,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053335091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:49,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-17 15:11:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175288844] [2025-03-17 15:11:49,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:49,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 15:11:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:49,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 15:11:49,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:11:49,274 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:11:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:49,523 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-17 15:11:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 15:11:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-17 15:11:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:49,524 INFO L225 Difference]: With dead ends: 76 [2025-03-17 15:11:49,524 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 15:11:49,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:11:49,525 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 100 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:49,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 139 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:11:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 15:11:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-03-17 15:11:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:11:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-03-17 15:11:49,537 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 25 [2025-03-17 15:11:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-03-17 15:11:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:11:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-03-17 15:11:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 15:11:49,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:49,538 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:49,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:11:49,739 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-17 15:11:49,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 972281457, now seen corresponding path program 1 times [2025-03-17 15:11:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811637461] [2025-03-17 15:11:49,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:49,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:11:49,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:11:49,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:49,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:11:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811637461] [2025-03-17 15:11:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811637461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037400894] [2025-03-17 15:11:49,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:49,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:49,978 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-17 15:11:49,979 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-17 15:11:50,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:11:50,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:11:50,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:50,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:50,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:11:50,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:50,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:11:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037400894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:50,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-03-17 15:11:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933846106] [2025-03-17 15:11:50,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:50,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 15:11:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:50,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 15:11:50,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-03-17 15:11:50,350 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 30 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 30 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-17 15:11:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:50,877 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2025-03-17 15:11:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-17 15:11:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 30 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 53 [2025-03-17 15:11:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:50,879 INFO L225 Difference]: With dead ends: 222 [2025-03-17 15:11:50,879 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 15:11:50,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 15:11:50,882 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 144 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:50,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 265 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:11:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 15:11:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2025-03-17 15:11:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 140 states have (on average 1.1285714285714286) internal successors, (158), 140 states have internal predecessors, (158), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:11:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2025-03-17 15:11:50,899 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 53 [2025-03-17 15:11:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:50,899 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2025-03-17 15:11:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 30 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-17 15:11:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2025-03-17 15:11:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:11:50,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:50,901 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:50,907 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-17 15:11:51,101 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-17 15:11:51,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 630532175, now seen corresponding path program 1 times [2025-03-17 15:11:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116297449] [2025-03-17 15:11:51,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:51,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:51,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:11:51,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:11:51,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:51,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 15:11:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116297449] [2025-03-17 15:11:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116297449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202634014] [2025-03-17 15:11:51,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:51,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:51,244 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-17 15:11:51,246 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-17 15:11:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:11:51,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:11:51,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:51,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:51,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:11:51,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 15:11:51,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 15:11:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202634014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:51,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:51,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 12 [2025-03-17 15:11:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010491648] [2025-03-17 15:11:51,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:51,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:11:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:51,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:11:51,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:11:51,417 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:11:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:51,518 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2025-03-17 15:11:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:11:51,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-03-17 15:11:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:51,520 INFO L225 Difference]: With dead ends: 208 [2025-03-17 15:11:51,520 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:11:51,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 112 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:11:51,521 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:51,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 151 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:11:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2025-03-17 15:11:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 145 states have (on average 1.1310344827586207) internal successors, (164), 145 states have internal predecessors, (164), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:11:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2025-03-17 15:11:51,531 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 61 [2025-03-17 15:11:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:51,531 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2025-03-17 15:11:51,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:11:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2025-03-17 15:11:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:11:51,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:51,532 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:51,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:11:51,732 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-17 15:11:51,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:51,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:51,733 INFO L85 PathProgramCache]: Analyzing trace with hash -523666053, now seen corresponding path program 2 times [2025-03-17 15:11:51,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:51,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616557568] [2025-03-17 15:11:51,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:11:51,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:51,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-17 15:11:51,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:11:51,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:11:51,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-17 15:11:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616557568] [2025-03-17 15:11:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616557568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:51,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:51,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:51,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335928660] [2025-03-17 15:11:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:51,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:11:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:51,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:11:51,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:11:51,804 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:11:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:51,829 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2025-03-17 15:11:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-03-17 15:11:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:51,831 INFO L225 Difference]: With dead ends: 199 [2025-03-17 15:11:51,832 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 15:11:51,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:51,832 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 15:11:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2025-03-17 15:11:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 126 states have (on average 1.119047619047619) internal successors, (141), 126 states have internal predecessors, (141), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:11:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2025-03-17 15:11:51,846 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 66 [2025-03-17 15:11:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:51,846 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2025-03-17 15:11:51,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:11:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2025-03-17 15:11:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 15:11:51,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:51,851 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:51,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:11:51,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:11:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1540435058, now seen corresponding path program 1 times [2025-03-17 15:11:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968250846] [2025-03-17 15:11:51,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:51,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:11:51,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:11:51,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:51,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 90 proven. 7 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-17 15:11:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968250846] [2025-03-17 15:11:52,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968250846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133508976] [2025-03-17 15:11:52,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:52,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:11:52,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:11:52,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:11:52,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:11:52,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:52,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:52,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:11:52,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 228 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-17 15:11:52,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 156 proven. 3 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-17 15:11:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133508976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:52,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2025-03-17 15:11:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493717041] [2025-03-17 15:11:52,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:52,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:11:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:52,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:11:52,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:11:52,375 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-17 15:11:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:52,708 INFO L93 Difference]: Finished difference Result 248 states and 272 transitions. [2025-03-17 15:11:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:11:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 113 [2025-03-17 15:11:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:52,709 INFO L225 Difference]: With dead ends: 248 [2025-03-17 15:11:52,709 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:11:52,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 206 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 15:11:52,710 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:52,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 335 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:11:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:11:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:11:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:11:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:11:52,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2025-03-17 15:11:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:52,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:11:52,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-17 15:11:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:11:52,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:11:52,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 15:11:52,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 15:11:52,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 15:11:52,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 15:11:52,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:11:52,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:52,920 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:52,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:11:53,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:11:53,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:11:53 BoogieIcfgContainer [2025-03-17 15:11:53,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:11:53,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:11:53,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:11:53,112 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:11:53,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:46" (3/4) ... [2025-03-17 15:11:53,114 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:11:53,118 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 15:11:53,118 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:11:53,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-17 15:11:53,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:11:53,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:11:53,121 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:11:53,181 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:11:53,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:11:53,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:11:53,183 INFO L158 Benchmark]: Toolchain (without parser) took 6637.48ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 113.2MB in the end (delta: 10.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,183 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:53,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.34ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 113.5MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.79ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.5MB in the end (delta: 955.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:53,184 INFO L158 Benchmark]: Boogie Preprocessor took 31.72ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.6MB in the end (delta: 968.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:53,184 INFO L158 Benchmark]: IcfgBuilder took 202.48ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 98.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,184 INFO L158 Benchmark]: TraceAbstraction took 6142.94ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 118.5MB in the end (delta: -20.8MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,184 INFO L158 Benchmark]: Witness Printer took 70.23ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 113.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,186 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.41ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.34ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 113.5MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.79ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.5MB in the end (delta: 955.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.72ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.6MB in the end (delta: 968.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 202.48ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 98.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6142.94ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 118.5MB in the end (delta: -20.8MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 70.23ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 113.2MB in the end (delta: 5.4MB). 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: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 49 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1477 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1162 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 891 IncrementalHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 315 mSDtfsCounter, 891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 526 SyntacticMatches, 21 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=10, InterpolantAutomatonStates: 158, 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, 12 MinimizatonAttempts, 109 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 754 NumberOfCodeBlocks, 754 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1006 ConstructedInterpolants, 0 QuantifiedInterpolants, 1880 SizeOfPredicates, 34 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 1263/1542 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 4 specifications checked. All of them hold - InvariantResult [Line: 36]: Location Invariant Derived location invariant: ((counter == 0) || (((counter == 5) || (counter < 5)) && (1 <= counter))) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: ((((counter <= 5) && (3 <= counter)) || ((6 <= counter) && (counter <= 2147483645))) || ((counter <= 3) && (1 <= counter))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:11:53,199 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