./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.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 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:56:59,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:56:59,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:56:59,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:56:59,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:56:59,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:56:59,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:56:59,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:56:59,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:56:59,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:56:59,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:56:59,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:56:59,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:56:59,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:56:59,579 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:56:59,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:56:59,580 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:56:59,581 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:56:59,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:56:59,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:56:59,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:56:59,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:56:59,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:56:59,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:56:59,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:56:59,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:56:59,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:56:59,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:56:59,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:56:59,583 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 [2025-03-09 01:56:59,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:56:59,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:56:59,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:56:59,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:56:59,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:56:59,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-09 01:57:00,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6057163/5de63411f2194bc992454392f149843c/FLAG1e9041ad3 [2025-03-09 01:57:01,175 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:57:01,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-09 01:57:01,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6057163/5de63411f2194bc992454392f149843c/FLAG1e9041ad3 [2025-03-09 01:57:01,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6057163/5de63411f2194bc992454392f149843c [2025-03-09 01:57:01,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:57:01,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:57:01,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:01,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:57:01,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:57:01,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ce2cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01, skipping insertion in model container [2025-03-09 01:57:01,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:57:01,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:01,668 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:57:01,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:57:01,689 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:57:01,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01 WrapperNode [2025-03-09 01:57:01,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:01,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:01,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:57:01,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:57:01,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,711 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-09 01:57:01,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:57:01,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:57:01,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:57:01,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:57:01,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,730 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-09 01:57:01,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:57:01,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:57:01,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:57:01,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:57:01,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (1/1) ... [2025-03-09 01:57:01,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:01,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:01,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:57:01,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:57:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:57:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:57:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:57:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:57:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 01:57:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 01:57:01,841 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:57:01,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:57:01,966 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-09 01:57:01,966 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:57:01,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:57:01,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:57:01,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:01 BoogieIcfgContainer [2025-03-09 01:57:01,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:57:01,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:57:01,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:57:01,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:57:01,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:57:01" (1/3) ... [2025-03-09 01:57:01,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf22577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:01, skipping insertion in model container [2025-03-09 01:57:01,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:01" (2/3) ... [2025-03-09 01:57:01,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf22577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:57:01, skipping insertion in model container [2025-03-09 01:57:01,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:01" (3/3) ... [2025-03-09 01:57:01,980 INFO L128 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2025-03-09 01:57:01,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:57:01,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sendmail-close-angle.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-09 01:57:02,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:57:02,035 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;@1f227430, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:57:02,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:57:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 42 states have internal predecessors, (49), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 01:57:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:57:02,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1840559368, now seen corresponding path program 1 times [2025-03-09 01:57:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392636926] [2025-03-09 01:57:02,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:57:02,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:57:02,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392636926] [2025-03-09 01:57:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392636926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:02,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818274447] [2025-03-09 01:57:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:02,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:02,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:02,175 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 42 states have internal predecessors, (49), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,214 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2025-03-09 01:57:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-09 01:57:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,220 INFO L225 Difference]: With dead ends: 94 [2025-03-09 01:57:02,221 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 01:57:02,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:02,225 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 01:57:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 01:57:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 34 states have internal predecessors, (35), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 01:57:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-09 01:57:02,251 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 6 [2025-03-09 01:57:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,251 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-09 01:57:02,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-09 01:57:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 01:57:02,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:57:02,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1222765553, now seen corresponding path program 1 times [2025-03-09 01:57:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555589270] [2025-03-09 01:57:02,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:57:02,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:57:02,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:57:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555589270] [2025-03-09 01:57:02,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555589270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:02,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:02,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:57:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705865418] [2025-03-09 01:57:02,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:02,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:57:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:02,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:57:02,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:02,296 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,309 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-09 01:57:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:57:02,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-03-09 01:57:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,311 INFO L225 Difference]: With dead ends: 43 [2025-03-09 01:57:02,311 INFO L226 Difference]: Without dead ends: 42 [2025-03-09 01:57:02,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:57:02,311 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 58 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-09 01:57:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-09 01:57:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.36) internal successors, (34), 33 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 01:57:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-09 01:57:02,321 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 7 [2025-03-09 01:57:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,321 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-09 01:57:02,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-09 01:57:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:57:02,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:57:02,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash -366741336, now seen corresponding path program 1 times [2025-03-09 01:57:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999373157] [2025-03-09 01:57:02,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:57:02,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:57:02,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,424 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-09 01:57:02,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999373157] [2025-03-09 01:57:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999373157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:02,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745305523] [2025-03-09 01:57:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:02,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:02,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:02,426 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-09 01:57:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,469 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-03-09 01:57:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:02,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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 21 [2025-03-09 01:57:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,470 INFO L225 Difference]: With dead ends: 55 [2025-03-09 01:57:02,470 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 01:57:02,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:02,471 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 01:57:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-03-09 01:57:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 01:57:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-03-09 01:57:02,486 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 21 [2025-03-09 01:57:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-03-09 01:57:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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-09 01:57:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-03-09 01:57:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:57:02,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:57:02,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash -508488273, now seen corresponding path program 1 times [2025-03-09 01:57:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795434320] [2025-03-09 01:57:02,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:57:02,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:57:02,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,545 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-09 01:57:02,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795434320] [2025-03-09 01:57:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795434320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:02,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888910347] [2025-03-09 01:57:02,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:02,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:02,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:02,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:02,547 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-09 01:57:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,572 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-03-09 01:57:02,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:02,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 22 [2025-03-09 01:57:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,575 INFO L225 Difference]: With dead ends: 57 [2025-03-09 01:57:02,575 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 01:57:02,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:02,576 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 123 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 01:57:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 01:57:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 01:57:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-03-09 01:57:02,585 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 22 [2025-03-09 01:57:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-09 01:57:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-09 01:57:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-03-09 01:57:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:57:02,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:57:02,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash -24493943, now seen corresponding path program 1 times [2025-03-09 01:57:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030776739] [2025-03-09 01:57:02,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:57:02,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:57:02,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,669 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-09 01:57:02,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030776739] [2025-03-09 01:57:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030776739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:02,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:02,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:57:02,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069160607] [2025-03-09 01:57:02,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:02,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:57:02,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:02,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:57:02,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:02,671 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 01:57:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,698 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2025-03-09 01:57:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:57:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2025-03-09 01:57:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,700 INFO L225 Difference]: With dead ends: 67 [2025-03-09 01:57:02,700 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 01:57:02,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:57:02,701 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 01:57:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-03-09 01:57:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 01:57:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-03-09 01:57:02,712 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 25 [2025-03-09 01:57:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,712 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-03-09 01:57:02,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 01:57:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-03-09 01:57:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:57:02,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,713 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:57:02,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,713 INFO L85 PathProgramCache]: Analyzing trace with hash 997667102, now seen corresponding path program 1 times [2025-03-09 01:57:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224478581] [2025-03-09 01:57:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:57:02,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:57:02,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:57:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224478581] [2025-03-09 01:57:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224478581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:02,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:57:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530218458] [2025-03-09 01:57:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:02,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:02,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:02,798 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-09 01:57:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,850 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2025-03-09 01:57:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 34 [2025-03-09 01:57:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,851 INFO L225 Difference]: With dead ends: 64 [2025-03-09 01:57:02,852 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 01:57:02,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:02,853 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 01:57:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-09 01:57:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 46 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 01:57:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2025-03-09 01:57:02,861 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 34 [2025-03-09 01:57:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,861 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2025-03-09 01:57:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-09 01:57:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2025-03-09 01:57:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:57:02,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,862 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:57:02,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash 862909063, now seen corresponding path program 1 times [2025-03-09 01:57:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941800463] [2025-03-09 01:57:02,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:57:02,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:57:02,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:57:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941800463] [2025-03-09 01:57:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941800463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:02,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:57:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165287458] [2025-03-09 01:57:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:02,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:02,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:02,929 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-09 01:57:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,968 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2025-03-09 01:57:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:02,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 35 [2025-03-09 01:57:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,969 INFO L225 Difference]: With dead ends: 64 [2025-03-09 01:57:02,969 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 01:57:02,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:57:02,970 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 157 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 01:57:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 01:57:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 41 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 01:57:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-09 01:57:02,975 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 35 [2025-03-09 01:57:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,975 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-09 01:57:02,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-09 01:57:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-09 01:57:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:57:02,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,976 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:57:02,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1695335713, now seen corresponding path program 1 times [2025-03-09 01:57:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265455206] [2025-03-09 01:57:02,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:57:02,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:57:02,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265455206] [2025-03-09 01:57:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265455206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:03,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622963315] [2025-03-09 01:57:03,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:03,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:03,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:03,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:03,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:57:03,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:57:03,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:57:03,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:03,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:03,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:03,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:03,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:57:03,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622963315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:03,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:57:03,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:57:03,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495468494] [2025-03-09 01:57:03,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:03,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:03,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:03,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:03,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:03,200 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 01:57:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:03,236 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-09 01:57:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:03,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2025-03-09 01:57:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:03,237 INFO L225 Difference]: With dead ends: 53 [2025-03-09 01:57:03,237 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:57:03,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:03,238 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:03,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 169 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:57:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-09 01:57:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 39 states have internal predecessors, (41), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 01:57:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-09 01:57:03,242 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 50 [2025-03-09 01:57:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:03,242 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-09 01:57:03,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 01:57:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-09 01:57:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 01:57:03,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:03,243 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:03,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:57:03,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:03,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:03,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:03,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1015799531, now seen corresponding path program 1 times [2025-03-09 01:57:03,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:03,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236232382] [2025-03-09 01:57:03,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:57:03,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:57:03,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:03,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236232382] [2025-03-09 01:57:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236232382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:03,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863565928] [2025-03-09 01:57:03,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:03,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:03,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:03,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:03,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:57:03,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:57:03,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:57:03,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:03,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:03,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:03,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:03,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863565928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:03,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:57:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143553672] [2025-03-09 01:57:03,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:03,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:57:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:57:03,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:03,693 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-09 01:57:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:03,795 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2025-03-09 01:57:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:57:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 51 [2025-03-09 01:57:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:03,796 INFO L225 Difference]: With dead ends: 89 [2025-03-09 01:57:03,796 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 01:57:03,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:03,797 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:03,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 01:57:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2025-03-09 01:57:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 01:57:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2025-03-09 01:57:03,806 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 51 [2025-03-09 01:57:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:03,806 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-09 01:57:03,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-09 01:57:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2025-03-09 01:57:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 01:57:03,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:03,807 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:03,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:04,008 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,SelfDestructingSolverStorable8 [2025-03-09 01:57:04,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:04,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash 114698370, now seen corresponding path program 1 times [2025-03-09 01:57:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596847793] [2025-03-09 01:57:04,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:04,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:04,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 01:57:04,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 01:57:04,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:04,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596847793] [2025-03-09 01:57:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596847793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785599482] [2025-03-09 01:57:04,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:04,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:04,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:04,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:04,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:57:04,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 01:57:04,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 01:57:04,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:04,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:04,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:04,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:04,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:57:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785599482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:04,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:57:04,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:57:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365125100] [2025-03-09 01:57:04,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:04,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:57:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:04,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:57:04,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:04,166 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 01:57:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:04,188 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2025-03-09 01:57:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:57:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2025-03-09 01:57:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:04,190 INFO L225 Difference]: With dead ends: 74 [2025-03-09 01:57:04,190 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 01:57:04,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:04,190 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:04,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 01:57:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-09 01:57:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 01:57:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2025-03-09 01:57:04,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 54 [2025-03-09 01:57:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:04,204 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2025-03-09 01:57:04,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 01:57:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2025-03-09 01:57:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:57:04,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:04,206 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:04,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:57:04,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:04,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:04,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash -739317837, now seen corresponding path program 1 times [2025-03-09 01:57:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:04,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528570218] [2025-03-09 01:57:04,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:04,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:04,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:57:04,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:57:04,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:04,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528570218] [2025-03-09 01:57:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528570218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246910680] [2025-03-09 01:57:04,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:04,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:04,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:04,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:04,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:57:04,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:57:04,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:57:04,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:04,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:04,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:57:04,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:04,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 01:57:04,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246910680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:04,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:04,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:57:04,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501071008] [2025-03-09 01:57:04,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:04,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:57:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:04,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:57:04,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:04,634 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-09 01:57:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:04,702 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2025-03-09 01:57:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:57:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 55 [2025-03-09 01:57:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:04,703 INFO L225 Difference]: With dead ends: 129 [2025-03-09 01:57:04,704 INFO L226 Difference]: Without dead ends: 128 [2025-03-09 01:57:04,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:04,704 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 49 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:04,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 234 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-09 01:57:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2025-03-09 01:57:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.21875) internal successors, (78), 68 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-09 01:57:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2025-03-09 01:57:04,712 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 55 [2025-03-09 01:57:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:04,713 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2025-03-09 01:57:04,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-09 01:57:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2025-03-09 01:57:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 01:57:04,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:04,714 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:04,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:57:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:04,919 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash 940454213, now seen corresponding path program 1 times [2025-03-09 01:57:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883476412] [2025-03-09 01:57:04,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:04,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:04,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 01:57:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 01:57:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-09 01:57:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883476412] [2025-03-09 01:57:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883476412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735962841] [2025-03-09 01:57:05,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:05,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:05,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:05,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:05,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:57:05,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 01:57:05,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 01:57:05,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:05,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:05,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:57:05,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-09 01:57:05,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:57:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735962841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:05,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:57:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-09 01:57:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477628089] [2025-03-09 01:57:05,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:05,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:57:05,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:05,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:57:05,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:05,095 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:57:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:05,147 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2025-03-09 01:57:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:57:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2025-03-09 01:57:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:05,148 INFO L225 Difference]: With dead ends: 94 [2025-03-09 01:57:05,148 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 01:57:05,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:05,149 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:05,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 200 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 01:57:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-09 01:57:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.203125) internal successors, (77), 67 states have internal predecessors, (77), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-09 01:57:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2025-03-09 01:57:05,157 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 63 [2025-03-09 01:57:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:05,157 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2025-03-09 01:57:05,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 01:57:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2025-03-09 01:57:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 01:57:05,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:05,158 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:05,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:05,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:57:05,359 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:05,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash -910690496, now seen corresponding path program 1 times [2025-03-09 01:57:05,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:05,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635951481] [2025-03-09 01:57:05,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:05,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:05,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:57:05,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:57:05,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:05,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-09 01:57:05,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635951481] [2025-03-09 01:57:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635951481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637650922] [2025-03-09 01:57:05,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:05,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:05,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:05,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:57:05,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:57:05,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:57:05,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:05,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:05,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:57:05,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-09 01:57:05,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-09 01:57:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637650922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:05,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-09 01:57:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708563245] [2025-03-09 01:57:05,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:05,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:57:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:05,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:57:05,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:57:05,603 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-09 01:57:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:05,690 INFO L93 Difference]: Finished difference Result 109 states and 146 transitions. [2025-03-09 01:57:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:57:05,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 64 [2025-03-09 01:57:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:05,692 INFO L225 Difference]: With dead ends: 109 [2025-03-09 01:57:05,692 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 01:57:05,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:57:05,693 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:05,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 252 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 01:57:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-09 01:57:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 64 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 01:57:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-03-09 01:57:05,701 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 64 [2025-03-09 01:57:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:05,701 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-03-09 01:57:05,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-09 01:57:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-03-09 01:57:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 01:57:05,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:05,722 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:05,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:05,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:05,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:05,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1306192181, now seen corresponding path program 1 times [2025-03-09 01:57:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946773217] [2025-03-09 01:57:05,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:05,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 01:57:05,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 01:57:05,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:05,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 01:57:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946773217] [2025-03-09 01:57:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946773217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245218869] [2025-03-09 01:57:06,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:57:06,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:06,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:06,002 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-09 01:57:06,003 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-09 01:57:06,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 01:57:06,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 01:57:06,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:57:06,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:06,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:57:06,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 01:57:06,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 01:57:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245218869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:06,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-09 01:57:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586341766] [2025-03-09 01:57:06,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:06,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:57:06,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:06,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:57:06,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:57:06,215 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-09 01:57:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:06,300 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2025-03-09 01:57:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:57:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 81 [2025-03-09 01:57:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:06,301 INFO L225 Difference]: With dead ends: 122 [2025-03-09 01:57:06,301 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 01:57:06,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:57:06,302 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:06,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 229 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 01:57:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2025-03-09 01:57:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 01:57:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 148 transitions. [2025-03-09 01:57:06,311 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 148 transitions. Word has length 81 [2025-03-09 01:57:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:06,311 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 148 transitions. [2025-03-09 01:57:06,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-09 01:57:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2025-03-09 01:57:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 01:57:06,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:06,313 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:06,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:06,517 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2063522421, now seen corresponding path program 2 times [2025-03-09 01:57:06,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878289549] [2025-03-09 01:57:06,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:06,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-09 01:57:06,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 01:57:06,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:06,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-09 01:57:06,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878289549] [2025-03-09 01:57:06,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878289549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657541098] [2025-03-09 01:57:06,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:06,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:06,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:06,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:06,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:57:06,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-09 01:57:06,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 01:57:06,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:06,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:06,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:57:06,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-09 01:57:06,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-09 01:57:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657541098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:06,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:06,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-09 01:57:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865391794] [2025-03-09 01:57:06,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:06,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:57:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:06,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:57:06,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:57:06,926 INFO L87 Difference]: Start difference. First operand 111 states and 148 transitions. Second operand has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-09 01:57:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:07,045 INFO L93 Difference]: Finished difference Result 144 states and 197 transitions. [2025-03-09 01:57:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:57:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 109 [2025-03-09 01:57:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:07,046 INFO L225 Difference]: With dead ends: 144 [2025-03-09 01:57:07,046 INFO L226 Difference]: Without dead ends: 143 [2025-03-09 01:57:07,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:57:07,047 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:07,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 239 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-09 01:57:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2025-03-09 01:57:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 88 states have internal predecessors, (100), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 01:57:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 168 transitions. [2025-03-09 01:57:07,058 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 168 transitions. Word has length 109 [2025-03-09 01:57:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:07,058 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 168 transitions. [2025-03-09 01:57:07,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-09 01:57:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 168 transitions. [2025-03-09 01:57:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 01:57:07,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:07,059 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:07,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:07,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:57:07,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:07,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1998746784, now seen corresponding path program 2 times [2025-03-09 01:57:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:07,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364838328] [2025-03-09 01:57:07,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:07,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:07,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-09 01:57:07,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 01:57:07,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:07,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-09 01:57:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364838328] [2025-03-09 01:57:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364838328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687404103] [2025-03-09 01:57:07,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:07,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:07,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:07,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:57:07,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-09 01:57:07,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 01:57:07,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:07,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:07,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:57:07,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-09 01:57:07,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-09 01:57:07,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687404103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:07,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:07,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-09 01:57:07,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235428213] [2025-03-09 01:57:07,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:07,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:57:07,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:07,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:57:07,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:57:07,845 INFO L87 Difference]: Start difference. First operand 124 states and 168 transitions. Second operand has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-09 01:57:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:07,988 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2025-03-09 01:57:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:57:07,989 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 122 [2025-03-09 01:57:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:07,990 INFO L225 Difference]: With dead ends: 151 [2025-03-09 01:57:07,990 INFO L226 Difference]: Without dead ends: 124 [2025-03-09 01:57:07,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:57:07,990 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:07,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 287 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-09 01:57:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2025-03-09 01:57:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 85 states have internal predecessors, (89), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-09 01:57:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2025-03-09 01:57:08,001 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 122 [2025-03-09 01:57:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:08,001 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2025-03-09 01:57:08,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-09 01:57:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2025-03-09 01:57:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-09 01:57:08,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:08,002 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:08,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:57:08,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:57:08,206 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 666723148, now seen corresponding path program 2 times [2025-03-09 01:57:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53745530] [2025-03-09 01:57:08,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:08,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-03-09 01:57:08,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 142 of 142 statements. [2025-03-09 01:57:08,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:08,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-09 01:57:08,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53745530] [2025-03-09 01:57:08,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53745530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:08,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871055797] [2025-03-09 01:57:08,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:08,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:08,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:08,402 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:08,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:57:08,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-03-09 01:57:08,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 142 of 142 statements. [2025-03-09 01:57:08,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:08,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:57:08,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-09 01:57:08,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-09 01:57:08,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871055797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:08,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:08,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-09 01:57:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170457420] [2025-03-09 01:57:08,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:08,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:57:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:08,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:57:08,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:57:08,725 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-09 01:57:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:08,846 INFO L93 Difference]: Finished difference Result 207 states and 273 transitions. [2025-03-09 01:57:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:57:08,847 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 142 [2025-03-09 01:57:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:08,848 INFO L225 Difference]: With dead ends: 207 [2025-03-09 01:57:08,848 INFO L226 Difference]: Without dead ends: 206 [2025-03-09 01:57:08,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:57:08,849 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 61 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:08,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 378 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-09 01:57:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 166. [2025-03-09 01:57:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 115 states have (on average 1.1304347826086956) internal successors, (130), 118 states have internal predecessors, (130), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-09 01:57:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 222 transitions. [2025-03-09 01:57:08,858 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 222 transitions. Word has length 142 [2025-03-09 01:57:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:08,859 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 222 transitions. [2025-03-09 01:57:08,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-09 01:57:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2025-03-09 01:57:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-09 01:57:08,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:08,860 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:08,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:57:09,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:57:09,061 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:09,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1313303563, now seen corresponding path program 2 times [2025-03-09 01:57:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:09,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939261266] [2025-03-09 01:57:09,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:09,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-03-09 01:57:09,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-03-09 01:57:09,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:09,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-09 01:57:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939261266] [2025-03-09 01:57:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939261266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963475642] [2025-03-09 01:57:09,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:09,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:09,319 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:09,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:57:09,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-03-09 01:57:09,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-03-09 01:57:09,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:57:09,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:09,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:57:09,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-09 01:57:09,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-09 01:57:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963475642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:09,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:09,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-09 01:57:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449006494] [2025-03-09 01:57:09,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:09,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:57:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:09,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:57:09,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:57:09,790 INFO L87 Difference]: Start difference. First operand 166 states and 222 transitions. Second operand has 32 states, 31 states have (on average 4.580645161290323) internal successors, (142), 32 states have internal predecessors, (142), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-03-09 01:57:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:09,979 INFO L93 Difference]: Finished difference Result 240 states and 337 transitions. [2025-03-09 01:57:09,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:57:09,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.580645161290323) internal successors, (142), 32 states have internal predecessors, (142), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) Word has length 197 [2025-03-09 01:57:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:09,981 INFO L225 Difference]: With dead ends: 240 [2025-03-09 01:57:09,981 INFO L226 Difference]: Without dead ends: 239 [2025-03-09 01:57:09,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:57:09,982 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:09,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 394 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:57:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-09 01:57:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2025-03-09 01:57:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 148 states have (on average 1.1486486486486487) internal successors, (170), 151 states have internal predecessors, (170), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-09 01:57:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2025-03-09 01:57:09,994 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 197 [2025-03-09 01:57:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:09,994 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2025-03-09 01:57:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.580645161290323) internal successors, (142), 32 states have internal predecessors, (142), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-03-09 01:57:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2025-03-09 01:57:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-09 01:57:09,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:09,996 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:10,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:57:10,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:57:10,197 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:10,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1425742539, now seen corresponding path program 3 times [2025-03-09 01:57:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:10,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196170963] [2025-03-09 01:57:10,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:10,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 225 statements into 17 equivalence classes. [2025-03-09 01:57:10,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 225 statements. [2025-03-09 01:57:10,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:57:10,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2025-03-09 01:57:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196170963] [2025-03-09 01:57:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196170963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:57:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651167153] [2025-03-09 01:57:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:10,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:57:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:10,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:57:10,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:57:10,263 INFO L87 Difference]: Start difference. First operand 215 states and 294 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 01:57:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:10,341 INFO L93 Difference]: Finished difference Result 215 states and 294 transitions. [2025-03-09 01:57:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:57:10,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 225 [2025-03-09 01:57:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:10,343 INFO L225 Difference]: With dead ends: 215 [2025-03-09 01:57:10,344 INFO L226 Difference]: Without dead ends: 214 [2025-03-09 01:57:10,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:57:10,345 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:10,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-09 01:57:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-09 01:57:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 148 states have (on average 1.1418918918918919) internal successors, (169), 150 states have internal predecessors, (169), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-09 01:57:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 293 transitions. [2025-03-09 01:57:10,356 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 293 transitions. Word has length 225 [2025-03-09 01:57:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:10,357 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 293 transitions. [2025-03-09 01:57:10,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 01:57:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 293 transitions. [2025-03-09 01:57:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-09 01:57:10,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:10,360 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:10,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:57:10,360 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:10,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash -583989408, now seen corresponding path program 3 times [2025-03-09 01:57:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:10,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905826337] [2025-03-09 01:57:10,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:10,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 238 statements into 17 equivalence classes. [2025-03-09 01:57:10,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 238 statements. [2025-03-09 01:57:10,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:57:10,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-09 01:57:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905826337] [2025-03-09 01:57:10,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905826337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:10,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:57:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:57:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080419703] [2025-03-09 01:57:10,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:10,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:57:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:10,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:57:10,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:57:10,407 INFO L87 Difference]: Start difference. First operand 214 states and 293 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-09 01:57:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:10,483 INFO L93 Difference]: Finished difference Result 214 states and 293 transitions. [2025-03-09 01:57:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:57:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 238 [2025-03-09 01:57:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:10,485 INFO L225 Difference]: With dead ends: 214 [2025-03-09 01:57:10,485 INFO L226 Difference]: Without dead ends: 203 [2025-03-09 01:57:10,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:57:10,486 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:10,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-09 01:57:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-09 01:57:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-09 01:57:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 263 transitions. [2025-03-09 01:57:10,495 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 263 transitions. Word has length 238 [2025-03-09 01:57:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:10,496 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 263 transitions. [2025-03-09 01:57:10,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-09 01:57:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 263 transitions. [2025-03-09 01:57:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-09 01:57:10,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:10,498 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:10,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:57:10,498 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:10,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1589033836, now seen corresponding path program 3 times [2025-03-09 01:57:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:10,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531193530] [2025-03-09 01:57:10,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:10,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 316 statements into 20 equivalence classes. [2025-03-09 01:57:10,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 316 statements. [2025-03-09 01:57:10,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:57:10,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 117 proven. 116 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-09 01:57:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:10,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531193530] [2025-03-09 01:57:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531193530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:10,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935069188] [2025-03-09 01:57:10,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:10,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:10,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:10,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:57:10,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 316 statements into 20 equivalence classes. [2025-03-09 01:57:10,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 316 statements. [2025-03-09 01:57:10,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:57:10,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:10,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:57:10,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 117 proven. 116 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-09 01:57:10,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 117 proven. 116 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-09 01:57:11,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935069188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:11,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:11,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-09 01:57:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522314224] [2025-03-09 01:57:11,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:11,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:57:11,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:11,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:57:11,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:57:11,053 INFO L87 Difference]: Start difference. First operand 203 states and 263 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 01:57:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:11,093 INFO L93 Difference]: Finished difference Result 203 states and 263 transitions. [2025-03-09 01:57:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:57:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 316 [2025-03-09 01:57:11,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:11,095 INFO L225 Difference]: With dead ends: 203 [2025-03-09 01:57:11,095 INFO L226 Difference]: Without dead ends: 202 [2025-03-09 01:57:11,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 628 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:57:11,096 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 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-09 01:57:11,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-09 01:57:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-09 01:57:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.0070422535211268) internal successors, (143), 142 states have internal predecessors, (143), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-09 01:57:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2025-03-09 01:57:11,106 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 316 [2025-03-09 01:57:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:11,107 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2025-03-09 01:57:11,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 01:57:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2025-03-09 01:57:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-09 01:57:11,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:11,112 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:11,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:57:11,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:57:11,313 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:11,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1823361397, now seen corresponding path program 3 times [2025-03-09 01:57:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709785102] [2025-03-09 01:57:11,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:11,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 429 statements into 24 equivalence classes. [2025-03-09 01:57:11,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 429 statements. [2025-03-09 01:57:11,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:57:11,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7907 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7694 trivial. 0 not checked. [2025-03-09 01:57:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709785102] [2025-03-09 01:57:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709785102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463560490] [2025-03-09 01:57:11,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:57:11,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:11,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:11,368 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:11,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:57:11,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 429 statements into 24 equivalence classes. [2025-03-09 01:57:11,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 429 statements. [2025-03-09 01:57:11,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:57:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:11,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:57:11,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7907 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7694 trivial. 0 not checked. [2025-03-09 01:57:11,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:57:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7907 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7694 trivial. 0 not checked. [2025-03-09 01:57:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463560490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:57:11,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:57:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-09 01:57:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045683410] [2025-03-09 01:57:11,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:57:11,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:57:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:11,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:57:11,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:57:11,984 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-09 01:57:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:12,073 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2025-03-09 01:57:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:57:12,073 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 429 [2025-03-09 01:57:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:12,074 INFO L225 Difference]: With dead ends: 202 [2025-03-09 01:57:12,074 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:57:12,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 849 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:57:12,079 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:12,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 80 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:57:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:57:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:57:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:57:12,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 429 [2025-03-09 01:57:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:12,080 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:57:12,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-09 01:57:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:57:12,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-09 01:57:12,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-09 01:57:12,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:57:12,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:57:12,291 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:12,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:57:13,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:57:13,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:57:13 BoogieIcfgContainer [2025-03-09 01:57:13,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:57:13,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:57:13,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:57:13,638 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:57:13,639 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:57:01" (3/4) ... [2025-03-09 01:57:13,640 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:57:13,644 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 01:57:13,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-09 01:57:13,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:57:13,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:57:13,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:57:13,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:57:13,707 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:57:13,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:57:13,707 INFO L158 Benchmark]: Toolchain (without parser) took 12177.21ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 110.5MB in the beginning and 205.6MB in the end (delta: -95.1MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. [2025-03-09 01:57:13,708 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:13,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.19ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 99.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:13,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.67ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:13,710 INFO L158 Benchmark]: Boogie Preprocessor took 26.88ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.7MB in the end (delta: 887.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:13,710 INFO L158 Benchmark]: IcfgBuilder took 234.24ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 84.9MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:57:13,710 INFO L158 Benchmark]: TraceAbstraction took 11662.57ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 83.8MB in the beginning and 210.0MB in the end (delta: -126.2MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. [2025-03-09 01:57:13,710 INFO L158 Benchmark]: Witness Printer took 68.92ms. Allocated memory is still 343.9MB. Free memory was 210.0MB in the beginning and 205.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:13,711 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.19ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 99.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.67ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.88ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.7MB in the end (delta: 887.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 234.24ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 84.9MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11662.57ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 83.8MB in the beginning and 210.0MB in the end (delta: -126.2MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. * Witness Printer took 68.92ms. Allocated memory is still 343.9MB. Free memory was 210.0MB in the beginning and 205.6MB in the end (delta: 4.5MB). There was no memory consumed. 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: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: 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 2 procedures, 51 locations, 73 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 22, TraceHistogramMax: 58, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 4049 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3195 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1737 IncrementalHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 854 mSDtfsCounter, 1737 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3420 GetRequests, 3203 SyntacticMatches, 4 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=18, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 156 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 4079 NumberOfCodeBlocks, 2342 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5600 ConstructedInterpolants, 0 QuantifiedInterpolants, 10748 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2143 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 50004/51989 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 10 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((((((((inlen <= 2147483647) && (2 <= bufferlen)) && (in <= 2147483646)) && (1 <= in)) && (bufferlen <= 2147483646)) && (buf <= 2147483646)) && (1 <= buf)) || (((((inlen <= 2147483647) && (2 <= bufferlen)) && (buf == 0)) && (bufferlen <= 2147483646)) && (in == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:57:13,724 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