./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c --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/nla-digbench-scaling/lcm1_unwindbound5.c -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 befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:26:28,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:26:28,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:26:28,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:26:28,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:26:28,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:26:28,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:26:28,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:26:28,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:26:28,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:26:28,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:26:28,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:26:28,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:26:28,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:26:28,549 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:26:28,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:26:28,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:26:28,549 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:26:28,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:26:28,551 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:26:28,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:26:28,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:26:28,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:26:28,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:26:28,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:26:28,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:26:28,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:26:28,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:26:28,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:26:28,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:26:28,553 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 -> befa5004268d4c15cae2c05402ac6cc0f86cef85e498084909e66f7e8cc4b8f3 [2025-03-09 02:26:28,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:26:28,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:26:28,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:26:28,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:26:28,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:26:28,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2025-03-09 02:26:29,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e271600/95616d14a05d4b41ab65ff8e94b30319/FLAG39fa2e854 [2025-03-09 02:26:30,171 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:26:30,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound5.c [2025-03-09 02:26:30,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e271600/95616d14a05d4b41ab65ff8e94b30319/FLAG39fa2e854 [2025-03-09 02:26:30,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e271600/95616d14a05d4b41ab65ff8e94b30319 [2025-03-09 02:26:30,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:26:30,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:26:30,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:26:30,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:26:30,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:26:30,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15aa2641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30, skipping insertion in model container [2025-03-09 02:26:30,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:26:30,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:26:30,669 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:26:30,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:26:30,698 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:26:30,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30 WrapperNode [2025-03-09 02:26:30,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:26:30,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:26:30,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:26:30,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:26:30,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,726 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-09 02:26:30,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:26:30,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:26:30,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:26:30,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:26:30,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,749 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-09 02:26:30,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:26:30,760 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:26:30,760 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:26:30,760 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:26:30,761 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (1/1) ... [2025-03-09 02:26:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:26:30,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:30,793 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 02:26:30,798 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 02:26:30,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:26:30,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:26:30,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:26:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:26:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:26:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:26:30,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:26:30,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:26:30,816 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:26:30,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:26:30,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:26:31,004 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-09 02:26:31,004 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:26:31,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:26:31,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:26:31,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:26:31 BoogieIcfgContainer [2025-03-09 02:26:31,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:26:31,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:26:31,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:26:31,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:26:31,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:26:30" (1/3) ... [2025-03-09 02:26:31,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749028e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:26:31, skipping insertion in model container [2025-03-09 02:26:31,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:30" (2/3) ... [2025-03-09 02:26:31,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749028e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:26:31, skipping insertion in model container [2025-03-09 02:26:31,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:26:31" (3/3) ... [2025-03-09 02:26:31,022 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound5.c [2025-03-09 02:26:31,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:26:31,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound5.c that has 3 procedures, 47 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-09 02:26:31,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:26:31,093 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;@46a4bab9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:26:31,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:26:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:26:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:26:31,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:31,105 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:31,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:31,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -867382927, now seen corresponding path program 1 times [2025-03-09 02:26:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347235532] [2025-03-09 02:26:31,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:31,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:26:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:26:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:26:31,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347235532] [2025-03-09 02:26:31,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347235532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007080786] [2025-03-09 02:26:31,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:31,234 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 02:26:31,236 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 02:26:31,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:26:31,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:26:31,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:31,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:31,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 02:26:31,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:26:31,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:26:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007080786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:26:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 02:26:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637229507] [2025-03-09 02:26:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:31,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:26:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:31,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:26:31,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:26:31,342 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:26:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:31,354 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2025-03-09 02:26:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:26:31,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-09 02:26:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:31,359 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:26:31,359 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 02:26:31,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:26:31,362 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:31,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 02:26:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-09 02:26:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:26:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-09 02:26:31,389 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 25 [2025-03-09 02:26:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:31,390 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-09 02:26:31,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:26:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-09 02:26:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:26:31,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:31,392 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:31,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:31,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-09 02:26:31,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1360078897, now seen corresponding path program 1 times [2025-03-09 02:26:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274925553] [2025-03-09 02:26:31,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:31,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:26:31,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:26:31,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:31,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:31,706 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 02:26:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274925553] [2025-03-09 02:26:31,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274925553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:31,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:31,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:26:31,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172391656] [2025-03-09 02:26:31,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:31,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:26:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:31,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:26:31,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:31,709 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:26:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:31,748 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-09 02:26:31,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:26:31,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2025-03-09 02:26:31,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:31,749 INFO L225 Difference]: With dead ends: 45 [2025-03-09 02:26:31,749 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 02:26:31,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:26:31,750 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:31,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 02:26:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-09 02:26:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:26:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-09 02:26:31,755 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2025-03-09 02:26:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:31,760 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-09 02:26:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:26:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-09 02:26:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:26:31,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:31,760 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 02:26:31,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:26:31,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:31,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1700255200, now seen corresponding path program 1 times [2025-03-09 02:26:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470090624] [2025-03-09 02:26:31,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:31,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:26:31,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:26:31,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:31,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:31,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 02:26:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470090624] [2025-03-09 02:26:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470090624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:26:31,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989154699] [2025-03-09 02:26:31,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:31,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:26:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:31,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:26:31,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:26:31,931 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:32,070 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-09 02:26:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:26:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-09 02:26:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:32,071 INFO L225 Difference]: With dead ends: 62 [2025-03-09 02:26:32,071 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 02:26:32,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:32,072 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:32,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 177 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 02:26:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-09 02:26:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:26:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-09 02:26:32,079 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 35 [2025-03-09 02:26:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:32,079 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-09 02:26:32,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-09 02:26:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:26:32,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:32,080 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, 1] [2025-03-09 02:26:32,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:26:32,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:32,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1168303653, now seen corresponding path program 1 times [2025-03-09 02:26:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144834710] [2025-03-09 02:26:32,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:32,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:26:32,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:26:32,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:32,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:32,227 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 02:26:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144834710] [2025-03-09 02:26:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144834710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:32,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:26:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736539] [2025-03-09 02:26:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:32,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:26:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:32,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:26:32,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:26:32,231 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:32,319 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2025-03-09 02:26:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:26:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-09 02:26:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:32,322 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:26:32,322 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 02:26:32,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:32,323 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:32,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 02:26:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-09 02:26:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:26:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-09 02:26:32,329 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 36 [2025-03-09 02:26:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:32,330 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-09 02:26:32,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-09 02:26:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:26:32,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:32,331 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:32,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:26:32,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:32,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1272493830, now seen corresponding path program 1 times [2025-03-09 02:26:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797777455] [2025-03-09 02:26:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:32,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:26:32,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:26:32,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:32,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:32,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:32,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797777455] [2025-03-09 02:26:32,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797777455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:32,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:26:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696362521] [2025-03-09 02:26:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:32,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:26:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:32,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:26:32,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:32,461 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:32,779 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-09 02:26:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:26:32,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-03-09 02:26:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:32,780 INFO L225 Difference]: With dead ends: 81 [2025-03-09 02:26:32,781 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 02:26:32,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:26:32,782 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:32,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:26:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 02:26:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-09 02:26:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:26:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-09 02:26:32,792 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 45 [2025-03-09 02:26:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:32,793 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-09 02:26:32,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-09 02:26:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:26:32,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:32,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:32,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:26:32,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 792603048, now seen corresponding path program 1 times [2025-03-09 02:26:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293321263] [2025-03-09 02:26:32,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:32,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:26:32,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:26:32,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:32,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:32,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293321263] [2025-03-09 02:26:32,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293321263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:32,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:32,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:26:32,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254095906] [2025-03-09 02:26:32,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:32,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:26:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:32,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:26:32,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:32,938 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:33,103 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-03-09 02:26:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:26:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2025-03-09 02:26:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:33,106 INFO L225 Difference]: With dead ends: 115 [2025-03-09 02:26:33,106 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 02:26:33,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:26:33,107 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:33,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 02:26:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-09 02:26:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 65 states have internal predecessors, (77), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:26:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-09 02:26:33,119 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 46 [2025-03-09 02:26:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:33,119 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-09 02:26:33,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-09 02:26:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:26:33,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:33,121 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:33,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:26:33,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 792675539, now seen corresponding path program 1 times [2025-03-09 02:26:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478319431] [2025-03-09 02:26:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:33,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:26:33,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:26:33,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:33,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:33,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:33,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478319431] [2025-03-09 02:26:33,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478319431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488121376] [2025-03-09 02:26:33,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:33,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:33,228 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 02:26:33,230 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 02:26:33,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:26:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:26:33,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:33,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:33,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:26:33,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:33,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488121376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:33,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:33,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-09 02:26:33,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136046266] [2025-03-09 02:26:33,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:33,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:26:33,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:33,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:26:33,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:26:33,476 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:26:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:33,971 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2025-03-09 02:26:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:26:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 46 [2025-03-09 02:26:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:33,973 INFO L225 Difference]: With dead ends: 233 [2025-03-09 02:26:33,973 INFO L226 Difference]: Without dead ends: 195 [2025-03-09 02:26:33,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2025-03-09 02:26:33,974 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:33,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 289 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-09 02:26:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2025-03-09 02:26:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 125 states have (on average 1.272) internal successors, (159), 130 states have internal predecessors, (159), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 02:26:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2025-03-09 02:26:33,993 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 46 [2025-03-09 02:26:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:33,993 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2025-03-09 02:26:33,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:26:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2025-03-09 02:26:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 02:26:33,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:33,996 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2025-03-09 02:26:34,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:26:34,196 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,SelfDestructingSolverStorable6 [2025-03-09 02:26:34,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:34,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1498090115, now seen corresponding path program 1 times [2025-03-09 02:26:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157456227] [2025-03-09 02:26:34,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:34,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:26:34,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:26:34,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:34,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157456227] [2025-03-09 02:26:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157456227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:26:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798698679] [2025-03-09 02:26:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:34,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:26:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:34,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:26:34,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:34,259 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:26:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:34,330 INFO L93 Difference]: Finished difference Result 270 states and 329 transitions. [2025-03-09 02:26:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:26:34,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2025-03-09 02:26:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:34,333 INFO L225 Difference]: With dead ends: 270 [2025-03-09 02:26:34,333 INFO L226 Difference]: Without dead ends: 205 [2025-03-09 02:26:34,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:34,334 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:34,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-09 02:26:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2025-03-09 02:26:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 146 states have internal predecessors, (182), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:26:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2025-03-09 02:26:34,354 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 55 [2025-03-09 02:26:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:34,354 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2025-03-09 02:26:34,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:26:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2025-03-09 02:26:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:26:34,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:34,356 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:26:34,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:34,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash -803810935, now seen corresponding path program 1 times [2025-03-09 02:26:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423431291] [2025-03-09 02:26:34,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:34,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:26:34,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:26:34,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:34,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423431291] [2025-03-09 02:26:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423431291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39748862] [2025-03-09 02:26:34,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:34,483 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 02:26:34,485 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 02:26:34,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:26:34,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:26:34,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:34,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:34,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:26:34,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:34,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39748862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:34,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-09 02:26:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698638569] [2025-03-09 02:26:34,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 02:26:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:34,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 02:26:34,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:26:34,779 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-09 02:26:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:35,735 INFO L93 Difference]: Finished difference Result 379 states and 473 transitions. [2025-03-09 02:26:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 02:26:35,736 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 56 [2025-03-09 02:26:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:35,738 INFO L225 Difference]: With dead ends: 379 [2025-03-09 02:26:35,738 INFO L226 Difference]: Without dead ends: 296 [2025-03-09 02:26:35,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 02:26:35,741 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:35,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 327 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:26:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-09 02:26:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2025-03-09 02:26:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 211 states have internal predecessors, (263), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 02:26:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 321 transitions. [2025-03-09 02:26:35,762 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 321 transitions. Word has length 56 [2025-03-09 02:26:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:35,763 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 321 transitions. [2025-03-09 02:26:35,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-09 02:26:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 321 transitions. [2025-03-09 02:26:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:26:35,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:35,764 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:35,772 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 02:26:35,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:35,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:35,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash -281102517, now seen corresponding path program 1 times [2025-03-09 02:26:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:35,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814303228] [2025-03-09 02:26:35,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:35,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:26:35,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:26:35,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:35,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:36,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:36,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814303228] [2025-03-09 02:26:36,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814303228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:36,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026288015] [2025-03-09 02:26:36,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:36,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:36,078 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 02:26:36,079 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 02:26:36,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:26:36,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:26:36,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:36,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:36,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:26:36,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:36,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026288015] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:36,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2025-03-09 02:26:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973035438] [2025-03-09 02:26:36,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 02:26:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:36,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 02:26:36,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:26:36,294 INFO L87 Difference]: Start difference. First operand 263 states and 321 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-09 02:26:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:36,699 INFO L93 Difference]: Finished difference Result 425 states and 526 transitions. [2025-03-09 02:26:36,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 02:26:36,700 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 59 [2025-03-09 02:26:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:36,702 INFO L225 Difference]: With dead ends: 425 [2025-03-09 02:26:36,702 INFO L226 Difference]: Without dead ends: 286 [2025-03-09 02:26:36,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:26:36,703 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:36,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 378 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:26:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-09 02:26:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 281. [2025-03-09 02:26:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 222 states have (on average 1.2567567567567568) internal successors, (279), 227 states have internal predecessors, (279), 30 states have call successors, (30), 23 states have call predecessors, (30), 23 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 02:26:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 339 transitions. [2025-03-09 02:26:36,719 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 339 transitions. Word has length 59 [2025-03-09 02:26:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:36,720 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 339 transitions. [2025-03-09 02:26:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 6 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-09 02:26:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 339 transitions. [2025-03-09 02:26:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:26:36,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:36,722 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:36,729 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 02:26:36,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:36,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:36,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash -926240830, now seen corresponding path program 1 times [2025-03-09 02:26:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:36,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243840651] [2025-03-09 02:26:36,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:36,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:26:36,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:26:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243840651] [2025-03-09 02:26:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243840651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068667967] [2025-03-09 02:26:37,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:37,080 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 02:26:37,081 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 02:26:37,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:26:37,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:26:37,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:37,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:37,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:26:37,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:37,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:26:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068667967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:37,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:26:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-09 02:26:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306963092] [2025-03-09 02:26:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:37,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:26:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:26:37,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:26:37,258 INFO L87 Difference]: Start difference. First operand 281 states and 339 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 02:26:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:37,617 INFO L93 Difference]: Finished difference Result 349 states and 421 transitions. [2025-03-09 02:26:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:26:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 65 [2025-03-09 02:26:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:37,619 INFO L225 Difference]: With dead ends: 349 [2025-03-09 02:26:37,619 INFO L226 Difference]: Without dead ends: 346 [2025-03-09 02:26:37,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:26:37,620 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:37,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:26:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-09 02:26:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 255. [2025-03-09 02:26:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 202 states have (on average 1.183168316831683) internal successors, (239), 205 states have internal predecessors, (239), 28 states have call successors, (28), 22 states have call predecessors, (28), 22 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-09 02:26:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 295 transitions. [2025-03-09 02:26:37,642 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 295 transitions. Word has length 65 [2025-03-09 02:26:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:37,643 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 295 transitions. [2025-03-09 02:26:37,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 02:26:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 295 transitions. [2025-03-09 02:26:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:26:37,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:37,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:37,650 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 02:26:37,844 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,SelfDestructingSolverStorable10 [2025-03-09 02:26:37,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:37,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1351305348, now seen corresponding path program 1 times [2025-03-09 02:26:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832794852] [2025-03-09 02:26:37,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:37,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:26:37,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:26:37,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:37,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:37,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832794852] [2025-03-09 02:26:37,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832794852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:37,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216452950] [2025-03-09 02:26:37,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:37,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:37,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:37,978 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 02:26:37,980 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 02:26:38,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:26:38,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:26:38,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:38,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:38,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:26:38,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:38,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:38,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216452950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:38,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:38,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-09 02:26:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025092201] [2025-03-09 02:26:38,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:38,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 02:26:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:38,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 02:26:38,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-09 02:26:38,335 INFO L87 Difference]: Start difference. First operand 255 states and 295 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 02:26:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:39,302 INFO L93 Difference]: Finished difference Result 294 states and 342 transitions. [2025-03-09 02:26:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 02:26:39,302 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 66 [2025-03-09 02:26:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:39,306 INFO L225 Difference]: With dead ends: 294 [2025-03-09 02:26:39,306 INFO L226 Difference]: Without dead ends: 293 [2025-03-09 02:26:39,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2025-03-09 02:26:39,308 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 174 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:39,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 369 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:26:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-09 02:26:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2025-03-09 02:26:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 213 states have (on average 1.1784037558685445) internal successors, (251), 216 states have internal predecessors, (251), 29 states have call successors, (29), 23 states have call predecessors, (29), 23 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 02:26:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 309 transitions. [2025-03-09 02:26:39,323 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 309 transitions. Word has length 66 [2025-03-09 02:26:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:39,323 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 309 transitions. [2025-03-09 02:26:39,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 02:26:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 309 transitions. [2025-03-09 02:26:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 02:26:39,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:39,324 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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 02:26:39,330 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 02:26:39,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:39,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:39,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash -112849287, now seen corresponding path program 1 times [2025-03-09 02:26:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-03-09 02:26:39,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:39,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:26:39,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:26:39,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:39,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:39,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-03-09 02:26:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472965487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139673234] [2025-03-09 02:26:39,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:39,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:39,666 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 02:26:39,667 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 02:26:39,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:26:39,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:26:39,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:39,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:39,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:26:39,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:39,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139673234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:39,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 15 [2025-03-09 02:26:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603906873] [2025-03-09 02:26:39,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:39,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:26:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:39,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:26:39,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:26:39,877 INFO L87 Difference]: Start difference. First operand 268 states and 309 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-09 02:26:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:40,044 INFO L93 Difference]: Finished difference Result 427 states and 497 transitions. [2025-03-09 02:26:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 02:26:40,047 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 70 [2025-03-09 02:26:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:40,049 INFO L225 Difference]: With dead ends: 427 [2025-03-09 02:26:40,049 INFO L226 Difference]: Without dead ends: 268 [2025-03-09 02:26:40,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 128 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:26:40,050 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:40,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 282 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-09 02:26:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-09 02:26:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 213 states have (on average 1.1737089201877935) internal successors, (250), 216 states have internal predecessors, (250), 29 states have call successors, (29), 23 states have call predecessors, (29), 23 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 02:26:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2025-03-09 02:26:40,062 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 70 [2025-03-09 02:26:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:40,063 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2025-03-09 02:26:40,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-09 02:26:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2025-03-09 02:26:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 02:26:40,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:40,064 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 02:26:40,070 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 02:26:40,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:40,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1620485776, now seen corresponding path program 1 times [2025-03-09 02:26:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491966898] [2025-03-09 02:26:40,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:40,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:26:40,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:26:40,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:40,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:26:40,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:40,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491966898] [2025-03-09 02:26:40,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491966898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172313139] [2025-03-09 02:26:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:40,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:40,452 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 02:26:40,454 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 02:26:40,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:26:40,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:26:40,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:40,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:40,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:26:40,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:40,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:26:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172313139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:40,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:40,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2025-03-09 02:26:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544720889] [2025-03-09 02:26:40,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:40,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 02:26:40,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:40,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 02:26:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:26:40,876 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 36 states have internal predecessors, (109), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-09 02:26:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:42,168 INFO L93 Difference]: Finished difference Result 456 states and 538 transitions. [2025-03-09 02:26:42,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-09 02:26:42,169 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 36 states have internal predecessors, (109), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) Word has length 76 [2025-03-09 02:26:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:42,171 INFO L225 Difference]: With dead ends: 456 [2025-03-09 02:26:42,171 INFO L226 Difference]: Without dead ends: 454 [2025-03-09 02:26:42,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1283, Invalid=4723, Unknown=0, NotChecked=0, Total=6006 [2025-03-09 02:26:42,173 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:42,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 419 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:26:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-09 02:26:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 387. [2025-03-09 02:26:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 308 states have (on average 1.1948051948051948) internal successors, (368), 311 states have internal predecessors, (368), 41 states have call successors, (41), 35 states have call predecessors, (41), 35 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-09 02:26:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 450 transitions. [2025-03-09 02:26:42,190 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 450 transitions. Word has length 76 [2025-03-09 02:26:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:42,190 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 450 transitions. [2025-03-09 02:26:42,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 36 states have internal predecessors, (109), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-09 02:26:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 450 transitions. [2025-03-09 02:26:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:26:42,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:42,191 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 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 02:26:42,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:26:42,396 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,SelfDestructingSolverStorable13 [2025-03-09 02:26:42,396 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:42,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1354261003, now seen corresponding path program 1 times [2025-03-09 02:26:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972485997] [2025-03-09 02:26:42,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:42,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:26:42,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:26:42,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:42,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:26:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972485997] [2025-03-09 02:26:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972485997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686879163] [2025-03-09 02:26:42,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:42,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:42,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:42,591 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 02:26:42,593 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 02:26:42,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:26:42,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:26:42,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:42,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:42,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:26:42,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 76 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:42,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:26:43,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686879163] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:43,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:43,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 40 [2025-03-09 02:26:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723398295] [2025-03-09 02:26:43,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:43,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-09 02:26:43,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:43,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-09 02:26:43,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 02:26:43,110 INFO L87 Difference]: Start difference. First operand 387 states and 450 transitions. Second operand has 41 states, 40 states have (on average 3.025) internal successors, (121), 41 states have internal predecessors, (121), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-09 02:26:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:44,489 INFO L93 Difference]: Finished difference Result 497 states and 575 transitions. [2025-03-09 02:26:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-09 02:26:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.025) internal successors, (121), 41 states have internal predecessors, (121), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) Word has length 80 [2025-03-09 02:26:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:44,492 INFO L225 Difference]: With dead ends: 497 [2025-03-09 02:26:44,492 INFO L226 Difference]: Without dead ends: 496 [2025-03-09 02:26:44,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1498, Invalid=6158, Unknown=0, NotChecked=0, Total=7656 [2025-03-09 02:26:44,494 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 327 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:44,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 451 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:26:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-09 02:26:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 345. [2025-03-09 02:26:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.1934306569343065) internal successors, (327), 277 states have internal predecessors, (327), 37 states have call successors, (37), 31 states have call predecessors, (37), 31 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:26:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 401 transitions. [2025-03-09 02:26:44,514 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 401 transitions. Word has length 80 [2025-03-09 02:26:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:44,514 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 401 transitions. [2025-03-09 02:26:44,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.025) internal successors, (121), 41 states have internal predecessors, (121), 16 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-09 02:26:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 401 transitions. [2025-03-09 02:26:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 02:26:44,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:44,516 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:44,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:44,720 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,SelfDestructingSolverStorable14 [2025-03-09 02:26:44,720 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:44,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1139431772, now seen corresponding path program 1 times [2025-03-09 02:26:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:44,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626531947] [2025-03-09 02:26:44,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:44,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 02:26:44,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:26:44,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:44,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-09 02:26:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626531947] [2025-03-09 02:26:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626531947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721384264] [2025-03-09 02:26:44,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:44,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:44,903 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 02:26:44,905 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 02:26:44,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 02:26:44,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:26:44,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:44,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:44,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:26:44,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 02:26:45,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-09 02:26:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721384264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:45,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 17 [2025-03-09 02:26:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330842269] [2025-03-09 02:26:45,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:45,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 02:26:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:45,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 02:26:45,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:26:45,185 INFO L87 Difference]: Start difference. First operand 345 states and 401 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-09 02:26:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:45,714 INFO L93 Difference]: Finished difference Result 769 states and 900 transitions. [2025-03-09 02:26:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 02:26:45,715 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 96 [2025-03-09 02:26:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:45,717 INFO L225 Difference]: With dead ends: 769 [2025-03-09 02:26:45,717 INFO L226 Difference]: Without dead ends: 553 [2025-03-09 02:26:45,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 179 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:26:45,718 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 65 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:45,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 596 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-09 02:26:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 516. [2025-03-09 02:26:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 413 states have (on average 1.2130750605326877) internal successors, (501), 416 states have internal predecessors, (501), 53 states have call successors, (53), 47 states have call predecessors, (53), 47 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-09 02:26:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 607 transitions. [2025-03-09 02:26:45,744 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 607 transitions. Word has length 96 [2025-03-09 02:26:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:45,745 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 607 transitions. [2025-03-09 02:26:45,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-09 02:26:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 607 transitions. [2025-03-09 02:26:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 02:26:45,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:45,747 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:45,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:45,951 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,SelfDestructingSolverStorable15 [2025-03-09 02:26:45,951 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:45,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -341088397, now seen corresponding path program 1 times [2025-03-09 02:26:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381191422] [2025-03-09 02:26:45,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:45,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:45,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 02:26:45,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 02:26:45,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-09 02:26:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381191422] [2025-03-09 02:26:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381191422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:26:46,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074469307] [2025-03-09 02:26:46,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:46,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:26:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:46,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:26:46,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:26:46,011 INFO L87 Difference]: Start difference. First operand 516 states and 607 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:26:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:46,070 INFO L93 Difference]: Finished difference Result 932 states and 1104 transitions. [2025-03-09 02:26:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:26:46,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2025-03-09 02:26:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:46,073 INFO L225 Difference]: With dead ends: 932 [2025-03-09 02:26:46,073 INFO L226 Difference]: Without dead ends: 559 [2025-03-09 02:26:46,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:26:46,074 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:46,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-09 02:26:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 522. [2025-03-09 02:26:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 420 states have (on average 1.207142857142857) internal successors, (507), 423 states have internal predecessors, (507), 52 states have call successors, (52), 47 states have call predecessors, (52), 47 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-09 02:26:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 611 transitions. [2025-03-09 02:26:46,100 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 611 transitions. Word has length 100 [2025-03-09 02:26:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 611 transitions. [2025-03-09 02:26:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:26:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 611 transitions. [2025-03-09 02:26:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:26:46,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:46,104 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1] [2025-03-09 02:26:46,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:26:46,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:46,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1740723666, now seen corresponding path program 2 times [2025-03-09 02:26:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:46,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984707009] [2025-03-09 02:26:46,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:26:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:46,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-09 02:26:46,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:26:46,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:26:46,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-09 02:26:46,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:46,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984707009] [2025-03-09 02:26:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984707009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:46,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:26:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063443000] [2025-03-09 02:26:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:46,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:26:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:46,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:26:46,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:26:46,270 INFO L87 Difference]: Start difference. First operand 522 states and 611 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:46,372 INFO L93 Difference]: Finished difference Result 550 states and 641 transitions. [2025-03-09 02:26:46,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:26:46,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 106 [2025-03-09 02:26:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:46,374 INFO L225 Difference]: With dead ends: 550 [2025-03-09 02:26:46,374 INFO L226 Difference]: Without dead ends: 549 [2025-03-09 02:26:46,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:26:46,375 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:46,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-09 02:26:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 525. [2025-03-09 02:26:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 423 states have (on average 1.2009456264775413) internal successors, (508), 426 states have internal predecessors, (508), 52 states have call successors, (52), 47 states have call predecessors, (52), 47 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-09 02:26:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 612 transitions. [2025-03-09 02:26:46,414 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 612 transitions. Word has length 106 [2025-03-09 02:26:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 612 transitions. [2025-03-09 02:26:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 612 transitions. [2025-03-09 02:26:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 02:26:46,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:46,416 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:46,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:26:46,416 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:46,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1487313239, now seen corresponding path program 1 times [2025-03-09 02:26:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692814438] [2025-03-09 02:26:46,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:46,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 02:26:46,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 02:26:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:46,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-09 02:26:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692814438] [2025-03-09 02:26:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692814438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687558477] [2025-03-09 02:26:46,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:46,504 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 02:26:46,505 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 02:26:46,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 02:26:46,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 02:26:46,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:46,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:46,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:26:46,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 196 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-09 02:26:46,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-09 02:26:46,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687558477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:46,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:46,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2025-03-09 02:26:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600388560] [2025-03-09 02:26:46,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:46,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:26:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:46,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:26:46,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:26:46,866 INFO L87 Difference]: Start difference. First operand 525 states and 612 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-09 02:26:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:47,515 INFO L93 Difference]: Finished difference Result 824 states and 962 transitions. [2025-03-09 02:26:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 02:26:47,516 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) Word has length 110 [2025-03-09 02:26:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:47,519 INFO L225 Difference]: With dead ends: 824 [2025-03-09 02:26:47,519 INFO L226 Difference]: Without dead ends: 602 [2025-03-09 02:26:47,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 199 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=1504, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 02:26:47,520 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:47,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 420 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-09 02:26:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 425. [2025-03-09 02:26:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 345 states have (on average 1.1884057971014492) internal successors, (410), 348 states have internal predecessors, (410), 41 states have call successors, (41), 36 states have call predecessors, (41), 36 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-09 02:26:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 492 transitions. [2025-03-09 02:26:47,541 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 492 transitions. Word has length 110 [2025-03-09 02:26:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:47,542 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 492 transitions. [2025-03-09 02:26:47,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 9 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-09 02:26:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 492 transitions. [2025-03-09 02:26:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-09 02:26:47,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:47,545 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 10, 10, 9, 9, 9, 9, 8, 4, 4, 4, 2, 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, 1, 1] [2025-03-09 02:26:47,552 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 02:26:47,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:47,746 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:47,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash -333555862, now seen corresponding path program 1 times [2025-03-09 02:26:47,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:47,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802911110] [2025-03-09 02:26:47,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:47,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-09 02:26:47,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-09 02:26:47,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:47,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-09 02:26:47,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:47,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802911110] [2025-03-09 02:26:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802911110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:47,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758451823] [2025-03-09 02:26:47,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:47,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:47,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:47,871 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 02:26:47,873 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 02:26:47,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-09 02:26:47,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-09 02:26:47,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:47,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:47,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:26:47,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 293 proven. 1 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-09 02:26:48,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 93 proven. 1 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2025-03-09 02:26:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758451823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:48,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2025-03-09 02:26:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532652800] [2025-03-09 02:26:48,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:48,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:26:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:48,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:26:48,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:26:48,251 INFO L87 Difference]: Start difference. First operand 425 states and 492 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-09 02:26:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:48,846 INFO L93 Difference]: Finished difference Result 786 states and 912 transitions. [2025-03-09 02:26:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 02:26:48,846 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 156 [2025-03-09 02:26:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:48,848 INFO L225 Difference]: With dead ends: 786 [2025-03-09 02:26:48,848 INFO L226 Difference]: Without dead ends: 341 [2025-03-09 02:26:48,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 289 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 02:26:48,850 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 111 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:48,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 388 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-09 02:26:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 202. [2025-03-09 02:26:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 161 states have (on average 1.1677018633540373) internal successors, (188), 162 states have internal predecessors, (188), 21 states have call successors, (21), 18 states have call predecessors, (21), 18 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-09 02:26:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 230 transitions. [2025-03-09 02:26:48,877 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 230 transitions. Word has length 156 [2025-03-09 02:26:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:48,877 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 230 transitions. [2025-03-09 02:26:48,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 10 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-09 02:26:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2025-03-09 02:26:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-09 02:26:48,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:48,878 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 11, 10, 10, 10, 9, 4, 4, 4, 2, 2, 2, 2, 2, 2, 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 02:26:48,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:49,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:49,079 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2010221641, now seen corresponding path program 1 times [2025-03-09 02:26:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734925070] [2025-03-09 02:26:49,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:49,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-09 02:26:49,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-09 02:26:49,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:49,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-09 02:26:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734925070] [2025-03-09 02:26:49,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734925070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:49,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:49,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:26:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984427093] [2025-03-09 02:26:49,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:49,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:26:49,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:49,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:26:49,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:49,160 INFO L87 Difference]: Start difference. First operand 202 states and 230 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:26:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:49,191 INFO L93 Difference]: Finished difference Result 356 states and 407 transitions. [2025-03-09 02:26:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:26:49,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 160 [2025-03-09 02:26:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:49,193 INFO L225 Difference]: With dead ends: 356 [2025-03-09 02:26:49,193 INFO L226 Difference]: Without dead ends: 193 [2025-03-09 02:26:49,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:49,194 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:49,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 143 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-09 02:26:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2025-03-09 02:26:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 145 states have internal predecessors, (157), 19 states have call successors, (19), 16 states have call predecessors, (19), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 02:26:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2025-03-09 02:26:49,203 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 160 [2025-03-09 02:26:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:49,204 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2025-03-09 02:26:49,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:26:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2025-03-09 02:26:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-09 02:26:49,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:49,205 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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 02:26:49,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:26:49,206 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:49,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1768344369, now seen corresponding path program 2 times [2025-03-09 02:26:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:49,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211670205] [2025-03-09 02:26:49,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:26:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:49,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-09 02:26:49,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-09 02:26:49,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:26:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 137 proven. 7 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-03-09 02:26:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:49,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211670205] [2025-03-09 02:26:49,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211670205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:49,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674162286] [2025-03-09 02:26:49,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:26:49,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:49,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:49,383 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 02:26:49,384 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 02:26:49,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-09 02:26:49,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-09 02:26:49,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:26:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:49,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:26:49,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 472 proven. 4 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-09 02:26:49,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 272 proven. 4 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-09 02:26:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674162286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:49,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:49,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 22 [2025-03-09 02:26:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751441422] [2025-03-09 02:26:49,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:49,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 02:26:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:49,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 02:26:49,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:26:49,804 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 10 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-09 02:26:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:50,353 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2025-03-09 02:26:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 02:26:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 10 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 160 [2025-03-09 02:26:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:50,356 INFO L225 Difference]: With dead ends: 308 [2025-03-09 02:26:50,356 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 02:26:50,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 296 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 02:26:50,358 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 77 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:50,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 451 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 02:26:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2025-03-09 02:26:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 148 states have (on average 1.0743243243243243) internal successors, (159), 148 states have internal predecessors, (159), 19 states have call successors, (19), 16 states have call predecessors, (19), 16 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 02:26:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2025-03-09 02:26:50,369 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 160 [2025-03-09 02:26:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:50,369 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2025-03-09 02:26:50,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 10 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-09 02:26:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2025-03-09 02:26:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-09 02:26:50,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:50,371 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:50,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:50,571 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 02:26:50,571 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:50,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash 204943619, now seen corresponding path program 1 times [2025-03-09 02:26:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:50,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653051877] [2025-03-09 02:26:50,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:50,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-09 02:26:50,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-09 02:26:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2025-03-09 02:26:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653051877] [2025-03-09 02:26:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653051877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367763459] [2025-03-09 02:26:50,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:50,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:50,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:50,737 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:26:50,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:26:50,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-09 02:26:50,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-09 02:26:50,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:50,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:50,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:26:50,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-09 02:26:50,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:26:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367763459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:50,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:26:50,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-09 02:26:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899846053] [2025-03-09 02:26:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:50,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:26:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:50,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:26:50,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:26:50,861 INFO L87 Difference]: Start difference. First operand 184 states and 197 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:50,907 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2025-03-09 02:26:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:26:50,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 182 [2025-03-09 02:26:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:50,908 INFO L225 Difference]: With dead ends: 192 [2025-03-09 02:26:50,908 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:26:50,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:26:50,909 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:50,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:26:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:26:50,910 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 02:26:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:26:50,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2025-03-09 02:26:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:50,910 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:26:50,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:26:50,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:26:50,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 02:26:50,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 02:26:50,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 02:26:50,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 02:26:50,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 02:26:50,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 02:26:50,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:51,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:51,117 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:51,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:26:52,569 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:26:52,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:26:52 BoogieIcfgContainer [2025-03-09 02:26:52,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:26:52,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:26:52,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:26:52,582 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:26:52,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:26:31" (3/4) ... [2025-03-09 02:26:52,585 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:26:52,590 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-09 02:26:52,590 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:26:52,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-09 02:26:52,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 02:26:52,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:26:52,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:26:52,596 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:26:52,661 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:26:52,662 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:26:52,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:26:52,662 INFO L158 Benchmark]: Toolchain (without parser) took 22145.47ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 129.7MB in the beginning and 269.9MB in the end (delta: -140.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2025-03-09 02:26:52,664 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 126.2MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:26:52,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.67ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 118.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:26:52,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.51ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:26:52,664 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 115.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:26:52,664 INFO L158 Benchmark]: IcfgBuilder took 252.22ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 102.1MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:26:52,664 INFO L158 Benchmark]: TraceAbstraction took 21566.92ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 101.7MB in the beginning and 273.5MB in the end (delta: -171.8MB). Peak memory consumption was 151.6MB. Max. memory is 16.1GB. [2025-03-09 02:26:52,664 INFO L158 Benchmark]: Witness Printer took 79.88ms. Allocated memory is still 318.8MB. Free memory was 273.5MB in the beginning and 269.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:26:52,665 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.23ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 126.2MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.67ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 118.1MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.51ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 115.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 252.22ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 102.1MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21566.92ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 101.7MB in the beginning and 273.5MB in the end (delta: -171.8MB). Peak memory consumption was 151.6MB. Max. memory is 16.1GB. * Witness Printer took 79.88ms. Allocated memory is still 318.8MB. Free memory was 273.5MB in the beginning and 269.9MB in the end (delta: 3.6MB). 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: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 73 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 23, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1816 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1810 mSDsluCounter, 6182 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5214 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4732 IncrementalHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 968 mSDtfsCounter, 4732 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2676 GetRequests, 2028 SyntacticMatches, 58 SemanticMatches, 590 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6503 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=18, InterpolantAutomatonStates: 469, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 874 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 3102 NumberOfCodeBlocks, 3102 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4029 ConstructedInterpolants, 0 QuantifiedInterpolants, 7279 SizeOfPredicates, 106 NumberOfNonLiveVariables, 2941 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 48 InterpolantComputations, 12 PerfectInterpolantSequences, 9344/9911 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 44]: Location Invariant Derived location invariant: (((((counter == 3) || (counter == 5)) || (counter == 4)) || ((y != x) && (counter == 1))) || (counter == 2)) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((counter <= 5) && (3 <= counter)) || ((6 <= counter) && (counter <= 2147483645))) || (((2 <= counter) && (counter <= 5)) && (x <= y))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((4 <= counter) && (counter <= 2147483646)) || (counter == 0)) || (((counter <= 2147483646) && (x <= y)) && (3 <= counter))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:26:52,682 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