./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.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_unwindbound20.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 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:11:42,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:11:42,448 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:42,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:11:42,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:11:42,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:11:42,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:11:42,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:11:42,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:11:42,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:11:42,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:11:42,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:11:42,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:11:42,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:11:42,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:11:42,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:11:42,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:11:42,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:11:42,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:11:42,473 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 -> 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 [2025-03-17 15:11:42,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:11:42,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:11:42,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:11:42,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:11:42,694 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:11:42,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2025-03-17 15:11:43,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb6f2ae1/fe872f67c88b449dadc0d9ea3798d651/FLAG8890e8aae [2025-03-17 15:11:44,081 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:11:44,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2025-03-17 15:11:44,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb6f2ae1/fe872f67c88b449dadc0d9ea3798d651/FLAG8890e8aae [2025-03-17 15:11:44,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb6f2ae1/fe872f67c88b449dadc0d9ea3798d651 [2025-03-17 15:11:44,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:11:44,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:11:44,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:11:44,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:11:44,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:11:44,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440a6d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44, skipping insertion in model container [2025-03-17 15:11:44,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:11:44,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:11:44,547 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:11:44,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:11:44,565 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:11:44,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44 WrapperNode [2025-03-17 15:11:44,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:11:44,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:11:44,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:11:44,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:11:44,570 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:44" (1/1) ... [2025-03-17 15:11:44,574 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:44" (1/1) ... [2025-03-17 15:11:44,583 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-17 15:11:44,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:11:44,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:11:44,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:11:44,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:11:44,588 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:44" (1/1) ... [2025-03-17 15:11:44,588 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:44" (1/1) ... [2025-03-17 15:11:44,589 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:44" (1/1) ... [2025-03-17 15:11:44,595 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:44,595 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:44" (1/1) ... [2025-03-17 15:11:44,595 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:44" (1/1) ... [2025-03-17 15:11:44,597 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:44" (1/1) ... [2025-03-17 15:11:44,598 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:44" (1/1) ... [2025-03-17 15:11:44,598 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:44" (1/1) ... [2025-03-17 15:11:44,598 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:44" (1/1) ... [2025-03-17 15:11:44,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:11:44,600 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:11:44,600 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:11:44,600 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:11:44,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (1/1) ... [2025-03-17 15:11:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:11:44,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:44,622 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:44,624 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:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:11:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:11:44,639 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:11:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:11:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:11:44,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:11:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:11:44,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:11:44,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:11:44,683 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:11:44,798 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 15:11:44,798 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:11:44,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:11:44,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:11:44,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:44 BoogieIcfgContainer [2025-03-17 15:11:44,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:11:44,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:11:44,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:11:44,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:11:44,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:11:44" (1/3) ... [2025-03-17 15:11:44,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdf06fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:44, skipping insertion in model container [2025-03-17 15:11:44,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:11:44" (2/3) ... [2025-03-17 15:11:44,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdf06fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:11:44, skipping insertion in model container [2025-03-17 15:11:44,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:11:44" (3/3) ... [2025-03-17 15:11:44,811 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2025-03-17 15:11:44,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:11:44,822 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_unwindbound20.i that has 3 procedures, 34 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 15:11:44,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:11:44,862 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;@456f7f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:11:44,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 15:11:44,865 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:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:11:44,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:44,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:44,870 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:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash -265482271, now seen corresponding path program 1 times [2025-03-17 15:11:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:44,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738167913] [2025-03-17 15:11:44,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:44,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:44,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:44,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:44,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:44,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:44,976 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:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738167913] [2025-03-17 15:11:44,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738167913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331325806] [2025-03-17 15:11:44,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:44,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:44,980 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:44,982 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:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:45,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:45,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:11:45,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:45,046 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:45,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:11:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331325806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:11:45,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:11:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687791391] [2025-03-17 15:11:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:11:45,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:11:45,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:11:45,069 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:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,080 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2025-03-17 15:11:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:11:45,083 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:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,087 INFO L225 Difference]: With dead ends: 65 [2025-03-17 15:11:45,088 INFO L226 Difference]: Without dead ends: 28 [2025-03-17 15:11:45,090 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:45,093 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:45,093 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:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-17 15:11:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 15:11:45,119 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:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-17 15:11:45,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2025-03-17 15:11:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,122 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-17 15:11:45,122 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:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-17 15:11:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:11:45,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:45,129 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:45,324 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:45,324 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:45,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2033804479, now seen corresponding path program 1 times [2025-03-17 15:11:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258294444] [2025-03-17 15:11:45,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:11:45,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:11:45,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,404 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:45,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258294444] [2025-03-17 15:11:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258294444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:11:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162971964] [2025-03-17 15:11:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:11:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:11:45,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:11:45,406 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:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,439 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-17 15:11:45,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:11:45,440 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:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,440 INFO L225 Difference]: With dead ends: 33 [2025-03-17 15:11:45,440 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 15:11:45,441 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:45,441 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:45,441 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:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 15:11:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-03-17 15:11:45,444 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:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-17 15:11:45,445 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2025-03-17 15:11:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,445 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-17 15:11:45,445 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:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-17 15:11:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:11:45,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:45,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:11:45,446 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:45,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1376570584, now seen corresponding path program 1 times [2025-03-17 15:11:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431873924] [2025-03-17 15:11:45,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:11:45,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:11:45,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,511 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:45,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431873924] [2025-03-17 15:11:45,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431873924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:11:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211851705] [2025-03-17 15:11:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:11:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:11:45,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:11:45,512 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:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,544 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-17 15:11:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:45,545 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:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,545 INFO L225 Difference]: With dead ends: 45 [2025-03-17 15:11:45,546 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 15:11:45,546 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:45,547 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:45,547 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:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 15:11:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 15:11:45,550 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:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-17 15:11:45,551 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2025-03-17 15:11:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,551 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-17 15:11:45,551 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:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-17 15:11:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:11:45,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,552 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:45,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:11:45,552 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:45,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1297720685, now seen corresponding path program 1 times [2025-03-17 15:11:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295676598] [2025-03-17 15:11:45,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:11:45,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:11:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,651 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:45,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295676598] [2025-03-17 15:11:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295676598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925905924] [2025-03-17 15:11:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:11:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:11:45,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:45,655 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:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,723 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-17 15:11:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:11:45,723 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:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,724 INFO L225 Difference]: With dead ends: 31 [2025-03-17 15:11:45,724 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 15:11:45,724 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:45,724 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:45,725 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:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 15:11:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 15:11:45,727 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:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-17 15:11:45,728 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2025-03-17 15:11:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,728 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-17 15:11:45,728 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:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-17 15:11:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:11:45,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,729 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:45,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:11:45,729 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:45,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1574635590, now seen corresponding path program 1 times [2025-03-17 15:11:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431965055] [2025-03-17 15:11:45,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:45,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:45,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,806 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:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431965055] [2025-03-17 15:11:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431965055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:45,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:45,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557718046] [2025-03-17 15:11:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:45,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:11:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:45,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:11:45,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:11:45,807 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:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:45,862 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-03-17 15:11:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:11:45,862 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:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:45,863 INFO L225 Difference]: With dead ends: 40 [2025-03-17 15:11:45,863 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 15:11:45,863 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:45,864 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:45,864 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:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 15:11:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-03-17 15:11:45,867 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:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-17 15:11:45,868 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2025-03-17 15:11:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:45,868 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-17 15:11:45,868 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:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-17 15:11:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:11:45,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:45,868 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:45,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:11:45,869 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:45,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:45,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1574564092, now seen corresponding path program 1 times [2025-03-17 15:11:45,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:45,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713809635] [2025-03-17 15:11:45,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:45,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:45,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:45,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,946 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:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713809635] [2025-03-17 15:11:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713809635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839462094] [2025-03-17 15:11:45,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:45,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:45,948 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:45,950 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:45,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:11:45,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:11:45,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:45,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:45,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:11:45,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:46,018 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:46,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:11:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839462094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:46,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:11:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-17 15:11:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523274213] [2025-03-17 15:11:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:46,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:11:46,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:46,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:11:46,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:11:46,020 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:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:46,063 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-17 15:11:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:46,063 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:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:46,064 INFO L225 Difference]: With dead ends: 38 [2025-03-17 15:11:46,064 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 15:11:46,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:11:46,064 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:46,064 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:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 15:11:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2025-03-17 15:11:46,067 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:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-17 15:11:46,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2025-03-17 15:11:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:46,068 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-17 15:11:46,068 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:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-17 15:11:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:11:46,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:46,068 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:46,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:11:46,270 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:46,270 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:46,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:46,271 INFO L85 PathProgramCache]: Analyzing trace with hash -222621797, now seen corresponding path program 1 times [2025-03-17 15:11:46,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:46,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356871642] [2025-03-17 15:11:46,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:46,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:46,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:11:46,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:11:46,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:46,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:46,320 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:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356871642] [2025-03-17 15:11:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356871642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494048432] [2025-03-17 15:11:46,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:46,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:46,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:46,322 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:46,324 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:46,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:11:46,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:11:46,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:46,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:46,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:11:46,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:46,380 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:46,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:46,440 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:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494048432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:46,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-17 15:11:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762148022] [2025-03-17 15:11:46,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:46,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:11:46,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:46,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:11:46,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:11:46,442 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:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:46,529 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-03-17 15:11:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:11:46,529 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:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:46,530 INFO L225 Difference]: With dead ends: 67 [2025-03-17 15:11:46,530 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 15:11:46,530 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:46,530 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:46,530 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:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 15:11:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-03-17 15:11:46,536 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:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-03-17 15:11:46,536 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2025-03-17 15:11:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:46,537 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-17 15:11:46,537 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:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-03-17 15:11:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:11:46,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:46,537 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:46,543 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:46,741 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:46,741 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:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1687826702, now seen corresponding path program 1 times [2025-03-17 15:11:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399565205] [2025-03-17 15:11:46,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:46,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:11:46,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:11:46,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:46,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:46,824 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:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399565205] [2025-03-17 15:11:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399565205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845661803] [2025-03-17 15:11:46,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:46,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:46,835 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:46,836 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:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:11:46,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:11:46,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:46,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:46,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:11:46,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:46,920 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:46,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:46,991 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:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845661803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:46,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-17 15:11:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122977347] [2025-03-17 15:11:46,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:46,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 15:11:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:46,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 15:11:46,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:11:46,993 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:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:47,222 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-17 15:11:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 15:11:47,223 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:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:47,223 INFO L225 Difference]: With dead ends: 76 [2025-03-17 15:11:47,223 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 15:11:47,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:11:47,224 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:47,224 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:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 15:11:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-03-17 15:11:47,229 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:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-03-17 15:11:47,230 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 25 [2025-03-17 15:11:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-03-17 15:11:47,230 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:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-03-17 15:11:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 15:11:47,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:47,231 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:47,237 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:47,432 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:47,432 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:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 972281457, now seen corresponding path program 1 times [2025-03-17 15:11:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256364337] [2025-03-17 15:11:47,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:47,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:11:47,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:11:47,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,610 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:47,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:47,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256364337] [2025-03-17 15:11:47,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256364337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:47,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530063180] [2025-03-17 15:11:47,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:47,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:47,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:47,613 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:47,614 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:47,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:11:47,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:11:47,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:47,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:47,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:11:47,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:47,789 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:47,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:47,958 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:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530063180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:47,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:47,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-03-17 15:11:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484961807] [2025-03-17 15:11:47,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:47,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 15:11:47,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:47,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 15:11:47,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-03-17 15:11:47,960 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:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:48,437 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2025-03-17 15:11:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-17 15:11:48,437 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:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:48,439 INFO L225 Difference]: With dead ends: 222 [2025-03-17 15:11:48,439 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 15:11:48,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 15:11:48,441 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:48,441 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.1s Time] [2025-03-17 15:11:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 15:11:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2025-03-17 15:11:48,461 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:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2025-03-17 15:11:48,462 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 53 [2025-03-17 15:11:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:48,462 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2025-03-17 15:11:48,462 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:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2025-03-17 15:11:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:11:48,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:48,463 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:48,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:11:48,664 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:48,664 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:48,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 630532175, now seen corresponding path program 1 times [2025-03-17 15:11:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:48,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087833674] [2025-03-17 15:11:48,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:48,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:48,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:11:48,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:11:48,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:48,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:48,797 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:48,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087833674] [2025-03-17 15:11:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087833674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:48,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123243626] [2025-03-17 15:11:48,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:48,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:48,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:48,800 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:48,802 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:48,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:11:48,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:11:48,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:48,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:48,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 15:11:48,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:48,898 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:48,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:49,033 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:49,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123243626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:49,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:49,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2025-03-17 15:11:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215239499] [2025-03-17 15:11:49,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:49,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:11:49,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:49,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:11:49,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:11:49,035 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:11:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:49,311 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2025-03-17 15:11:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 15:11:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2025-03-17 15:11:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:49,312 INFO L225 Difference]: With dead ends: 248 [2025-03-17 15:11:49,313 INFO L226 Difference]: Without dead ends: 222 [2025-03-17 15:11:49,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 15:11:49,314 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 91 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:49,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 168 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:11:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-17 15:11:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2025-03-17 15:11:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.1411764705882352) internal successors, (194), 170 states have internal predecessors, (194), 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:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2025-03-17 15:11:49,330 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 61 [2025-03-17 15:11:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:49,330 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2025-03-17 15:11:49,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.227272727272727) internal successors, (71), 22 states have internal predecessors, (71), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:11:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2025-03-17 15:11:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 15:11:49,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:49,334 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 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:49,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:11:49,534 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:49,535 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:49,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1715411663, now seen corresponding path program 2 times [2025-03-17 15:11:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:49,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506134283] [2025-03-17 15:11:49,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:11:49,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:49,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-17 15:11:49,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 15:11:49,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:11:49,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-17 15:11:49,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506134283] [2025-03-17 15:11:49,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506134283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:49,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:11:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692961008] [2025-03-17 15:11:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:49,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:11:49,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:49,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:11:49,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:11:49,612 INFO L87 Difference]: Start difference. First operand 198 states and 222 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:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:49,635 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2025-03-17 15:11:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:11:49,635 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 91 [2025-03-17 15:11:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:49,637 INFO L225 Difference]: With dead ends: 224 [2025-03-17 15:11:49,637 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 15:11:49,637 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:49,637 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:49,637 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:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 15:11:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2025-03-17 15:11:49,644 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:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2025-03-17 15:11:49,645 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 91 [2025-03-17 15:11:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:49,645 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2025-03-17 15:11:49,645 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:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2025-03-17 15:11:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 15:11:49,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:49,646 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:49,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:11:49,646 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:49,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1540435058, now seen corresponding path program 1 times [2025-03-17 15:11:49,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:49,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065263106] [2025-03-17 15:11:49,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:49,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:11:49,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:11:49,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:49,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 15:11:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065263106] [2025-03-17 15:11:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065263106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:11:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838935919] [2025-03-17 15:11:50,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:11:50,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:11:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:11:50,110 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:50,111 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:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:11:50,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:11:50,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:11:50,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:50,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 15:11:50,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:11:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:11:50,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:11:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 15:11:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838935919] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:11:51,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:11:51,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-03-17 15:11:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179040900] [2025-03-17 15:11:51,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:11:51,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-17 15:11:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:51,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-17 15:11:51,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2025-03-17 15:11:51,280 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 66 states, 65 states have (on average 3.3076923076923075) internal successors, (215), 66 states have internal predecessors, (215), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2025-03-17 15:11:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:52,734 INFO L93 Difference]: Finished difference Result 532 states and 599 transitions. [2025-03-17 15:11:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-17 15:11:52,734 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.3076923076923075) internal successors, (215), 66 states have internal predecessors, (215), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 113 [2025-03-17 15:11:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:52,736 INFO L225 Difference]: With dead ends: 532 [2025-03-17 15:11:52,736 INFO L226 Difference]: Without dead ends: 531 [2025-03-17 15:11:52,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4405, Invalid=11597, Unknown=0, NotChecked=0, Total=16002 [2025-03-17 15:11:52,740 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 529 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:52,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 341 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:11:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-17 15:11:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 324. [2025-03-17 15:11:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 266 states have (on average 1.1165413533834587) internal successors, (297), 266 states have internal predecessors, (297), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:11:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 355 transitions. [2025-03-17 15:11:52,760 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 355 transitions. Word has length 113 [2025-03-17 15:11:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:52,760 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 355 transitions. [2025-03-17 15:11:52,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.3076923076923075) internal successors, (215), 66 states have internal predecessors, (215), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2025-03-17 15:11:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 355 transitions. [2025-03-17 15:11:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-17 15:11:52,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:11:52,764 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:52,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:11:52,965 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,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:52,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:11:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash 869432538, now seen corresponding path program 2 times [2025-03-17 15:11:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:11:52,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776281110] [2025-03-17 15:11:52,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:11:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:11:52,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 228 statements into 2 equivalence classes. [2025-03-17 15:11:53,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 15:11:53,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:11:53,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:11:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1634 trivial. 0 not checked. [2025-03-17 15:11:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:11:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776281110] [2025-03-17 15:11:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776281110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:11:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:11:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:11:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350354080] [2025-03-17 15:11:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:11:53,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:11:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:11:53,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:11:53,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:11:53,224 INFO L87 Difference]: Start difference. First operand 324 states and 355 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:11:53,264 INFO L93 Difference]: Finished difference Result 328 states and 359 transitions. [2025-03-17 15:11:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:11:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 228 [2025-03-17 15:11:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:11:53,266 INFO L225 Difference]: With dead ends: 328 [2025-03-17 15:11:53,266 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:11:53,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:11:53,268 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:11:53,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:11:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:11:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:11:53,270 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:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:11:53,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 228 [2025-03-17 15:11:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:11:53,270 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:11:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:11:53,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:11:53,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 15:11:53,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 15:11:53,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 15:11:53,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 15:11:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:11:53,276 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:11:53,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:11:53,777 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:11:53,787 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,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:11:53,788 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:11:53,788 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:11:53,788 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:11:53,789 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:44" (3/4) ... [2025-03-17 15:11:53,790 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:11:53,794 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 15:11:53,794 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:11:53,797 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-17 15:11:53,797 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:11:53,798 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:11:53,798 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:11:53,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:11:53,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:11:53,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:11:53,860 INFO L158 Benchmark]: Toolchain (without parser) took 9444.41ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 112.3MB in the beginning and 189.1MB in the end (delta: -76.8MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,860 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:53,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.97ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.48ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 100.0MB in the end (delta: 941.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:53,861 INFO L158 Benchmark]: Boogie Preprocessor took 15.94ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:11:53,861 INFO L158 Benchmark]: IcfgBuilder took 205.13ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 86.1MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,861 INFO L158 Benchmark]: TraceAbstraction took 8981.01ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 85.6MB in the beginning and 193.4MB in the end (delta: -107.8MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,861 INFO L158 Benchmark]: Witness Printer took 71.11ms. Allocated memory is still 243.3MB. Free memory was 193.4MB in the beginning and 189.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:11:53,862 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.97ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.48ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 100.0MB in the end (delta: 941.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.94ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 205.13ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 86.1MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8981.01ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 85.6MB in the beginning and 193.4MB in the end (delta: -107.8MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. * Witness Printer took 71.11ms. Allocated memory is still 243.3MB. Free memory was 193.4MB in the beginning and 189.1MB in the end (delta: 4.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: 8.4s, OverallIterations: 13, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1000 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1000 mSDsluCounter, 1565 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1250 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1035 IncrementalHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 315 mSDtfsCounter, 1035 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 806 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4643 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=12, InterpolantAutomatonStates: 248, 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, 13 MinimizatonAttempts, 356 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1007 NumberOfCodeBlocks, 1007 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1258 ConstructedInterpolants, 0 QuantifiedInterpolants, 2404 SizeOfPredicates, 42 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 2446/3493 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: (((1 <= counter) && (counter <= 20)) || (counter == 0)) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((1 <= counter) && (counter <= 20)) || ((21 <= counter) && (counter <= 2147483645))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:11:53,878 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