./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:20:19,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:20:19,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:20:19,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:20:19,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:20:19,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:20:19,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:20:19,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:20:19,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:20:19,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:20:19,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:20:19,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:20:19,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:20:19,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:20:19,759 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:20:19,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:20:19,760 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:20:19,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:20:19,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:20:19,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:20:19,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:20:19,762 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-jdk21/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 -> 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 [2025-02-08 09:20:19,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:20:19,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:20:19,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:20:19,981 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:20:19,981 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:20:19,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2025-02-08 09:20:21,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ffd9d924/c1d68c45b5e74268a8a61a6e4a5aed5f/FLAG16ad881bd [2025-02-08 09:20:21,393 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:20:21,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2025-02-08 09:20:21,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ffd9d924/c1d68c45b5e74268a8a61a6e4a5aed5f/FLAG16ad881bd [2025-02-08 09:20:21,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ffd9d924/c1d68c45b5e74268a8a61a6e4a5aed5f [2025-02-08 09:20:21,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:20:21,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:20:21,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:20:21,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:20:21,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:20:21,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545c5485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21, skipping insertion in model container [2025-02-08 09:20:21,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:20:21,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:20:21,848 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:20:21,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:20:21,895 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:20:21,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21 WrapperNode [2025-02-08 09:20:21,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:20:21,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:20:21,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:20:21,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:20:21,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,940 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-02-08 09:20:21,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:20:21,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:20:21,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:20:21,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:20:21,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,968 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 09:20:21,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:20:21,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:20:21,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:20:21,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:20:21,985 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (1/1) ... [2025-02-08 09:20:21,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:20:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:22,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:20:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:20:22,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:20:22,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:20:22,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:20:22,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:20:22,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:20:22,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:20:22,076 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:20:22,077 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:20:22,676 INFO L? ?]: Removed 238 outVars from TransFormulas that were not future-live. [2025-02-08 09:20:22,677 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:20:22,692 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:20:22,694 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:20:22,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:20:22 BoogieIcfgContainer [2025-02-08 09:20:22,694 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:20:22,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:20:22,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:20:22,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:20:22,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:20:21" (1/3) ... [2025-02-08 09:20:22,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fb2654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:20:22, skipping insertion in model container [2025-02-08 09:20:22,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:20:21" (2/3) ... [2025-02-08 09:20:22,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fb2654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:20:22, skipping insertion in model container [2025-02-08 09:20:22,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:20:22" (3/3) ... [2025-02-08 09:20:22,702 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.c [2025-02-08 09:20:22,711 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:20:22,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound1.c that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 140 error locations. [2025-02-08 09:20:22,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:20:22,765 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;@2f87c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:20:22,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 140 error locations. [2025-02-08 09:20:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 149 states have (on average 1.9664429530201342) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 09:20:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 09:20:22,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:22,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 09:20:22,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:22,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 325640, now seen corresponding path program 1 times [2025-02-08 09:20:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:22,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902166154] [2025-02-08 09:20:22,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:22,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 09:20:22,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 09:20:22,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:22,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:20:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902166154] [2025-02-08 09:20:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902166154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750219713] [2025-02-08 09:20:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:22,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:22,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:22,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:20:22,920 INFO L87 Difference]: Start difference. First operand has 302 states, 149 states have (on average 1.9664429530201342) internal successors, (293), 289 states have internal predecessors, (293), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-02-08 09:20:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:22,995 INFO L93 Difference]: Finished difference Result 600 states and 648 transitions. [2025-02-08 09:20:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:20:22,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 09:20:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:23,001 INFO L225 Difference]: With dead ends: 600 [2025-02-08 09:20:23,001 INFO L226 Difference]: Without dead ends: 295 [2025-02-08 09:20:23,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-08 09:20:23,005 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 4 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:23,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 901 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:20:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-08 09:20:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-02-08 09:20:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 151 states have (on average 1.8874172185430464) internal successors, (285), 283 states have internal predecessors, (285), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:20:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 305 transitions. [2025-02-08 09:20:23,036 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 305 transitions. Word has length 3 [2025-02-08 09:20:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:23,036 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 305 transitions. [2025-02-08 09:20:23,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-02-08 09:20:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 305 transitions. [2025-02-08 09:20:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:20:23,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:23,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:20:23,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:20:23,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:23,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1111466748, now seen corresponding path program 1 times [2025-02-08 09:20:23,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:23,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156971652] [2025-02-08 09:20:23,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:23,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:23,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:20:23,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:20:23,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:23,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:20:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156971652] [2025-02-08 09:20:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156971652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:23,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:20:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394553181] [2025-02-08 09:20:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:23,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:23,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:23,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:23,070 INFO L87 Difference]: Start difference. First operand 295 states and 305 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:20:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:23,193 INFO L93 Difference]: Finished difference Result 563 states and 583 transitions. [2025-02-08 09:20:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 09:20:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:23,196 INFO L225 Difference]: With dead ends: 563 [2025-02-08 09:20:23,196 INFO L226 Difference]: Without dead ends: 543 [2025-02-08 09:20:23,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:23,197 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 237 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:23,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 699 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:20:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-08 09:20:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 353. [2025-02-08 09:20:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 204 states have (on average 1.7941176470588236) internal successors, (366), 336 states have internal predecessors, (366), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 09:20:23,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 396 transitions. [2025-02-08 09:20:23,213 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 396 transitions. Word has length 6 [2025-02-08 09:20:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:23,213 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 396 transitions. [2025-02-08 09:20:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:20:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 396 transitions. [2025-02-08 09:20:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 09:20:23,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:23,214 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:23,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:20:23,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:23,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash 262012332, now seen corresponding path program 1 times [2025-02-08 09:20:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:23,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764860933] [2025-02-08 09:20:23,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:23,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 09:20:23,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 09:20:23,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:23,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:23,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080637120] [2025-02-08 09:20:23,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:23,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:23,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:23,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:23,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:20:23,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 09:20:23,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 09:20:23,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:23,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:23,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:20:23,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:23,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764860933] [2025-02-08 09:20:23,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:23,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080637120] [2025-02-08 09:20:23,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080637120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:23,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:23,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737645353] [2025-02-08 09:20:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:23,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:23,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:23,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:23,506 INFO L87 Difference]: Start difference. First operand 353 states and 396 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:23,949 INFO L93 Difference]: Finished difference Result 513 states and 571 transitions. [2025-02-08 09:20:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:23,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-02-08 09:20:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:23,951 INFO L225 Difference]: With dead ends: 513 [2025-02-08 09:20:23,951 INFO L226 Difference]: Without dead ends: 458 [2025-02-08 09:20:23,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:23,952 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 134 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:23,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 361 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:20:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-08 09:20:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 438. [2025-02-08 09:20:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 284 states have (on average 1.6514084507042253) internal successors, (469), 416 states have internal predecessors, (469), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 09:20:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 509 transitions. [2025-02-08 09:20:23,967 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 509 transitions. Word has length 39 [2025-02-08 09:20:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:23,967 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 509 transitions. [2025-02-08 09:20:23,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 509 transitions. [2025-02-08 09:20:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 09:20:23,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:23,968 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:23,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:20:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:24,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:24,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1609212470, now seen corresponding path program 1 times [2025-02-08 09:20:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314719546] [2025-02-08 09:20:24,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:24,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 09:20:24,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 09:20:24,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:24,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:24,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314719546] [2025-02-08 09:20:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314719546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644741003] [2025-02-08 09:20:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:24,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:24,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:24,273 INFO L87 Difference]: Start difference. First operand 438 states and 509 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:24,471 INFO L93 Difference]: Finished difference Result 453 states and 516 transitions. [2025-02-08 09:20:24,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:24,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-02-08 09:20:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:24,474 INFO L225 Difference]: With dead ends: 453 [2025-02-08 09:20:24,475 INFO L226 Difference]: Without dead ends: 448 [2025-02-08 09:20:24,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:24,476 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 120 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:24,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 505 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-02-08 09:20:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2025-02-08 09:20:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 284 states have (on average 1.6338028169014085) internal successors, (464), 416 states have internal predecessors, (464), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 09:20:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 504 transitions. [2025-02-08 09:20:24,498 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 504 transitions. Word has length 41 [2025-02-08 09:20:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:24,499 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 504 transitions. [2025-02-08 09:20:24,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 504 transitions. [2025-02-08 09:20:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 09:20:24,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:24,499 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:20:24,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1654021195, now seen corresponding path program 1 times [2025-02-08 09:20:24,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:24,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031771778] [2025-02-08 09:20:24,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:24,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 09:20:24,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 09:20:24,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:24,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:24,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031771778] [2025-02-08 09:20:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031771778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:24,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:24,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551166069] [2025-02-08 09:20:24,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:24,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:24,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:24,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:24,566 INFO L87 Difference]: Start difference. First operand 438 states and 504 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:24,779 INFO L93 Difference]: Finished difference Result 453 states and 511 transitions. [2025-02-08 09:20:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-02-08 09:20:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:24,781 INFO L225 Difference]: With dead ends: 453 [2025-02-08 09:20:24,781 INFO L226 Difference]: Without dead ends: 448 [2025-02-08 09:20:24,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:24,782 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 119 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:24,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 547 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-02-08 09:20:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2025-02-08 09:20:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 284 states have (on average 1.6161971830985915) internal successors, (459), 416 states have internal predecessors, (459), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 09:20:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 499 transitions. [2025-02-08 09:20:24,802 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 499 transitions. Word has length 42 [2025-02-08 09:20:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:24,802 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 499 transitions. [2025-02-08 09:20:24,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 499 transitions. [2025-02-08 09:20:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 09:20:24,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:24,803 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:24,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:20:24,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -264950296, now seen corresponding path program 1 times [2025-02-08 09:20:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:24,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861792014] [2025-02-08 09:20:24,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:24,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 09:20:24,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 09:20:24,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:24,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:24,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861792014] [2025-02-08 09:20:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861792014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:20:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785609003] [2025-02-08 09:20:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:24,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:24,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:24,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:20:24,890 INFO L87 Difference]: Start difference. First operand 438 states and 499 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:25,627 INFO L93 Difference]: Finished difference Result 537 states and 660 transitions. [2025-02-08 09:20:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:20:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-08 09:20:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:25,630 INFO L225 Difference]: With dead ends: 537 [2025-02-08 09:20:25,630 INFO L226 Difference]: Without dead ends: 535 [2025-02-08 09:20:25,630 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-02-08 09:20:25,630 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 369 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:25,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 471 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 09:20:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-08 09:20:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 516. [2025-02-08 09:20:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 357 states have (on average 1.680672268907563) internal successors, (600), 489 states have internal predecessors, (600), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 09:20:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 650 transitions. [2025-02-08 09:20:25,641 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 650 transitions. Word has length 43 [2025-02-08 09:20:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:25,641 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 650 transitions. [2025-02-08 09:20:25,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 650 transitions. [2025-02-08 09:20:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 09:20:25,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:25,642 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:20:25,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:25,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash 376475625, now seen corresponding path program 1 times [2025-02-08 09:20:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10372197] [2025-02-08 09:20:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:25,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 09:20:25,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 09:20:25,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:25,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10372197] [2025-02-08 09:20:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10372197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:25,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:25,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:20:25,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811040220] [2025-02-08 09:20:25,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:25,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:25,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:25,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:25,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:20:25,685 INFO L87 Difference]: Start difference. First operand 516 states and 650 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:26,679 INFO L93 Difference]: Finished difference Result 538 states and 659 transitions. [2025-02-08 09:20:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:20:26,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-08 09:20:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:26,685 INFO L225 Difference]: With dead ends: 538 [2025-02-08 09:20:26,685 INFO L226 Difference]: Without dead ends: 536 [2025-02-08 09:20:26,685 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-02-08 09:20:26,686 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 368 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:26,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 408 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 09:20:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-08 09:20:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 517. [2025-02-08 09:20:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 358 states have (on average 1.6731843575418994) internal successors, (599), 490 states have internal predecessors, (599), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 09:20:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 649 transitions. [2025-02-08 09:20:26,707 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 649 transitions. Word has length 44 [2025-02-08 09:20:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:26,707 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 649 transitions. [2025-02-08 09:20:26,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 649 transitions. [2025-02-08 09:20:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 09:20:26,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:26,707 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:26,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:20:26,711 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:26,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1425940004, now seen corresponding path program 1 times [2025-02-08 09:20:26,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:26,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662164419] [2025-02-08 09:20:26,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:26,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:26,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 09:20:26,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 09:20:26,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:26,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:26,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653587272] [2025-02-08 09:20:26,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:26,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:26,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:20:26,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 09:20:26,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 09:20:26,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:26,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:26,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:20:26,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:26,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:26,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662164419] [2025-02-08 09:20:26,939 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653587272] [2025-02-08 09:20:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653587272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:26,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:26,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:26,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272367465] [2025-02-08 09:20:26,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:26,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:26,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:26,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:26,940 INFO L87 Difference]: Start difference. First operand 517 states and 649 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:27,313 INFO L93 Difference]: Finished difference Result 539 states and 656 transitions. [2025-02-08 09:20:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-02-08 09:20:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:27,315 INFO L225 Difference]: With dead ends: 539 [2025-02-08 09:20:27,315 INFO L226 Difference]: Without dead ends: 525 [2025-02-08 09:20:27,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:27,315 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 112 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:27,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 305 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:20:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-08 09:20:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 520. [2025-02-08 09:20:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 361 states have (on average 1.6371191135734071) internal successors, (591), 493 states have internal predecessors, (591), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 09:20:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 641 transitions. [2025-02-08 09:20:27,326 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 641 transitions. Word has length 47 [2025-02-08 09:20:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:27,326 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 641 transitions. [2025-02-08 09:20:27,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 641 transitions. [2025-02-08 09:20:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 09:20:27,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:27,326 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:27,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 09:20:27,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:27,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:27,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1254467365, now seen corresponding path program 1 times [2025-02-08 09:20:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247959946] [2025-02-08 09:20:27,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:27,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 09:20:27,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 09:20:27,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:27,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247959946] [2025-02-08 09:20:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247959946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:20:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086065056] [2025-02-08 09:20:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:27,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:27,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:27,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:20:27,599 INFO L87 Difference]: Start difference. First operand 520 states and 641 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:28,245 INFO L93 Difference]: Finished difference Result 529 states and 642 transitions. [2025-02-08 09:20:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:20:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-08 09:20:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:28,252 INFO L225 Difference]: With dead ends: 529 [2025-02-08 09:20:28,252 INFO L226 Difference]: Without dead ends: 527 [2025-02-08 09:20:28,252 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-02-08 09:20:28,252 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 255 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:28,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 402 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 09:20:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-08 09:20:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 520. [2025-02-08 09:20:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 361 states have (on average 1.631578947368421) internal successors, (589), 493 states have internal predecessors, (589), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 09:20:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 639 transitions. [2025-02-08 09:20:28,282 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 639 transitions. Word has length 48 [2025-02-08 09:20:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:28,282 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 639 transitions. [2025-02-08 09:20:28,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 639 transitions. [2025-02-08 09:20:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 09:20:28,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:28,287 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:28,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 09:20:28,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:28,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1811874207, now seen corresponding path program 1 times [2025-02-08 09:20:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:28,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680026298] [2025-02-08 09:20:28,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:28,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 09:20:28,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 09:20:28,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:28,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 09:20:28,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680026298] [2025-02-08 09:20:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680026298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:28,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:20:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312348174] [2025-02-08 09:20:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:28,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:28,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:28,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:20:28,395 INFO L87 Difference]: Start difference. First operand 520 states and 639 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:29,263 INFO L93 Difference]: Finished difference Result 543 states and 656 transitions. [2025-02-08 09:20:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:20:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-02-08 09:20:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:29,266 INFO L225 Difference]: With dead ends: 543 [2025-02-08 09:20:29,266 INFO L226 Difference]: Without dead ends: 508 [2025-02-08 09:20:29,267 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-02-08 09:20:29,268 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 358 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:29,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 357 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 09:20:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-02-08 09:20:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 496. [2025-02-08 09:20:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 341 states have (on average 1.6715542521994136) internal successors, (570), 471 states have internal predecessors, (570), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 616 transitions. [2025-02-08 09:20:29,282 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 616 transitions. Word has length 52 [2025-02-08 09:20:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:29,283 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 616 transitions. [2025-02-08 09:20:29,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 09:20:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 616 transitions. [2025-02-08 09:20:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-08 09:20:29,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:29,286 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:29,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 09:20:29,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:29,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash 908046274, now seen corresponding path program 1 times [2025-02-08 09:20:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:29,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17758162] [2025-02-08 09:20:29,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:29,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 09:20:29,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 09:20:29,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:29,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:29,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:29,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17758162] [2025-02-08 09:20:29,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17758162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:29,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:29,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:29,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375131488] [2025-02-08 09:20:29,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:29,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:29,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:29,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:29,395 INFO L87 Difference]: Start difference. First operand 496 states and 616 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:29,719 INFO L93 Difference]: Finished difference Result 503 states and 616 transitions. [2025-02-08 09:20:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:29,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 80 [2025-02-08 09:20:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:29,721 INFO L225 Difference]: With dead ends: 503 [2025-02-08 09:20:29,721 INFO L226 Difference]: Without dead ends: 502 [2025-02-08 09:20:29,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:29,721 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 63 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:29,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 425 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:20:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-08 09:20:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 496. [2025-02-08 09:20:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 341 states have (on average 1.6686217008797655) internal successors, (569), 471 states have internal predecessors, (569), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 615 transitions. [2025-02-08 09:20:29,738 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 615 transitions. Word has length 80 [2025-02-08 09:20:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:29,738 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 615 transitions. [2025-02-08 09:20:29,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 615 transitions. [2025-02-08 09:20:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 09:20:29,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:29,739 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:29,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 09:20:29,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1146759938, now seen corresponding path program 1 times [2025-02-08 09:20:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741343081] [2025-02-08 09:20:29,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:29,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 09:20:29,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 09:20:29,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741343081] [2025-02-08 09:20:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741343081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286396195] [2025-02-08 09:20:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:29,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:29,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:29,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:29,805 INFO L87 Difference]: Start difference. First operand 496 states and 615 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:30,012 INFO L93 Difference]: Finished difference Result 496 states and 615 transitions. [2025-02-08 09:20:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:30,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 84 [2025-02-08 09:20:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:30,014 INFO L225 Difference]: With dead ends: 496 [2025-02-08 09:20:30,014 INFO L226 Difference]: Without dead ends: 489 [2025-02-08 09:20:30,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:30,015 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:30,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 157 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-08 09:20:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-02-08 09:20:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 341 states have (on average 1.6363636363636365) internal successors, (558), 464 states have internal predecessors, (558), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2025-02-08 09:20:30,032 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 84 [2025-02-08 09:20:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:30,032 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2025-02-08 09:20:30,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2025-02-08 09:20:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 09:20:30,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:30,033 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:30,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 09:20:30,033 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:30,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1189819565, now seen corresponding path program 1 times [2025-02-08 09:20:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337354348] [2025-02-08 09:20:30,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:30,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 09:20:30,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 09:20:30,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:30,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337354348] [2025-02-08 09:20:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337354348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:30,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586008673] [2025-02-08 09:20:30,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:30,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:30,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:30,092 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:30,317 INFO L93 Difference]: Finished difference Result 498 states and 607 transitions. [2025-02-08 09:20:30,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:30,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-02-08 09:20:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:30,319 INFO L225 Difference]: With dead ends: 498 [2025-02-08 09:20:30,319 INFO L226 Difference]: Without dead ends: 497 [2025-02-08 09:20:30,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:30,320 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 62 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:30,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 441 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-08 09:20:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2025-02-08 09:20:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 343 states have (on average 1.6326530612244898) internal successors, (560), 466 states have internal predecessors, (560), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 606 transitions. [2025-02-08 09:20:30,335 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 606 transitions. Word has length 85 [2025-02-08 09:20:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:30,336 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 606 transitions. [2025-02-08 09:20:30,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 606 transitions. [2025-02-08 09:20:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 09:20:30,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:30,336 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:30,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 09:20:30,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:30,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -959823115, now seen corresponding path program 1 times [2025-02-08 09:20:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:30,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587105923] [2025-02-08 09:20:30,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:30,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 09:20:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 09:20:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587105923] [2025-02-08 09:20:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587105923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025722302] [2025-02-08 09:20:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:30,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:30,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:30,410 INFO L87 Difference]: Start difference. First operand 491 states and 606 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:20:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:30,484 INFO L93 Difference]: Finished difference Result 491 states and 606 transitions. [2025-02-08 09:20:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 87 [2025-02-08 09:20:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:30,487 INFO L225 Difference]: With dead ends: 491 [2025-02-08 09:20:30,487 INFO L226 Difference]: Without dead ends: 489 [2025-02-08 09:20:30,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:30,487 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 192 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:30,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 262 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:20:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-08 09:20:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-02-08 09:20:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 343 states have (on average 1.6151603498542273) internal successors, (554), 464 states have internal predecessors, (554), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 600 transitions. [2025-02-08 09:20:30,504 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 600 transitions. Word has length 87 [2025-02-08 09:20:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:30,504 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 600 transitions. [2025-02-08 09:20:30,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:20:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 600 transitions. [2025-02-08 09:20:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 09:20:30,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:30,505 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 09:20:30,505 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash -955292719, now seen corresponding path program 1 times [2025-02-08 09:20:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420950875] [2025-02-08 09:20:30,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:30,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 09:20:30,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 09:20:30,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:30,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420950875] [2025-02-08 09:20:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420950875] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:30,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864076067] [2025-02-08 09:20:30,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:30,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:30,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:30,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:20:30,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 09:20:30,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 09:20:30,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:30,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:30,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:20:30,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:30,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864076067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-08 09:20:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626173086] [2025-02-08 09:20:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:30,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:20:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:30,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:20:30,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:20:30,798 INFO L87 Difference]: Start difference. First operand 489 states and 600 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:30,829 INFO L93 Difference]: Finished difference Result 489 states and 600 transitions. [2025-02-08 09:20:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:20:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2025-02-08 09:20:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:30,831 INFO L225 Difference]: With dead ends: 489 [2025-02-08 09:20:30,831 INFO L226 Difference]: Without dead ends: 488 [2025-02-08 09:20:30,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:20:30,832 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 220 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:30,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 563 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:20:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-02-08 09:20:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-02-08 09:20:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 343 states have (on average 1.6122448979591837) internal successors, (553), 463 states have internal predecessors, (553), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 599 transitions. [2025-02-08 09:20:30,849 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 599 transitions. Word has length 87 [2025-02-08 09:20:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:30,849 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 599 transitions. [2025-02-08 09:20:30,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 599 transitions. [2025-02-08 09:20:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 09:20:30,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:30,850 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:30,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 09:20:31,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:31,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash 310254639, now seen corresponding path program 1 times [2025-02-08 09:20:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:31,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666642501] [2025-02-08 09:20:31,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:31,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 09:20:31,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 09:20:31,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:31,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:31,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666642501] [2025-02-08 09:20:31,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666642501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:31,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:31,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 09:20:31,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745711057] [2025-02-08 09:20:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:31,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:20:31,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:31,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:20:31,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:20:31,112 INFO L87 Difference]: Start difference. First operand 488 states and 599 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:31,376 INFO L93 Difference]: Finished difference Result 505 states and 599 transitions. [2025-02-08 09:20:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:20:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2025-02-08 09:20:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:31,378 INFO L225 Difference]: With dead ends: 505 [2025-02-08 09:20:31,378 INFO L226 Difference]: Without dead ends: 503 [2025-02-08 09:20:31,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:20:31,379 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 126 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:31,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 809 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:20:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-08 09:20:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 488. [2025-02-08 09:20:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 343 states have (on average 1.6064139941690962) internal successors, (551), 463 states have internal predecessors, (551), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 597 transitions. [2025-02-08 09:20:31,392 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 597 transitions. Word has length 88 [2025-02-08 09:20:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:31,392 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 597 transitions. [2025-02-08 09:20:31,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 597 transitions. [2025-02-08 09:20:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 09:20:31,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:31,394 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 09:20:31,394 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 450697045, now seen corresponding path program 1 times [2025-02-08 09:20:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495320977] [2025-02-08 09:20:31,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:31,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 09:20:31,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 09:20:31,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:31,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:31,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495320977] [2025-02-08 09:20:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495320977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496190929] [2025-02-08 09:20:31,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:31,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:31,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:20:31,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 09:20:31,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 09:20:31,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:31,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:31,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:20:31,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:31,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:31,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496190929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:31,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-08 09:20:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485587863] [2025-02-08 09:20:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:31,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:20:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:31,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:20:31,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:20:31,603 INFO L87 Difference]: Start difference. First operand 488 states and 597 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:31,658 INFO L93 Difference]: Finished difference Result 565 states and 601 transitions. [2025-02-08 09:20:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:20:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 88 [2025-02-08 09:20:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:31,660 INFO L225 Difference]: With dead ends: 565 [2025-02-08 09:20:31,660 INFO L226 Difference]: Without dead ends: 564 [2025-02-08 09:20:31,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:20:31,661 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 214 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:31,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1471 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:20:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-08 09:20:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 491. [2025-02-08 09:20:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 346 states have (on average 1.5982658959537572) internal successors, (553), 465 states have internal predecessors, (553), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 599 transitions. [2025-02-08 09:20:31,673 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 599 transitions. Word has length 88 [2025-02-08 09:20:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:31,673 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 599 transitions. [2025-02-08 09:20:31,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 599 transitions. [2025-02-08 09:20:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-08 09:20:31,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:31,674 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 09:20:31,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:31,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 09:20:31,875 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:31,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1027959347, now seen corresponding path program 1 times [2025-02-08 09:20:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:31,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265290542] [2025-02-08 09:20:31,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:31,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 09:20:31,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 09:20:31,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:31,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067349367] [2025-02-08 09:20:31,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:31,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:31,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:31,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:31,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 09:20:31,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 09:20:31,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 09:20:31,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:31,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:31,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:20:31,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:31,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:31,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:31,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265290542] [2025-02-08 09:20:31,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:31,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067349367] [2025-02-08 09:20:31,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067349367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:31,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:31,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:31,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981924817] [2025-02-08 09:20:31,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:31,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:31,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:31,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:31,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:31,984 INFO L87 Difference]: Start difference. First operand 491 states and 599 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:20:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:32,153 INFO L93 Difference]: Finished difference Result 501 states and 599 transitions. [2025-02-08 09:20:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:32,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2025-02-08 09:20:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:32,154 INFO L225 Difference]: With dead ends: 501 [2025-02-08 09:20:32,154 INFO L226 Difference]: Without dead ends: 493 [2025-02-08 09:20:32,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:32,155 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 55 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:32,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 504 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-08 09:20:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2025-02-08 09:20:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 346 states have (on average 1.5751445086705202) internal successors, (545), 465 states have internal predecessors, (545), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 591 transitions. [2025-02-08 09:20:32,167 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 591 transitions. Word has length 89 [2025-02-08 09:20:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:32,167 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 591 transitions. [2025-02-08 09:20:32,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:20:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 591 transitions. [2025-02-08 09:20:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 09:20:32,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:32,168 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 09:20:32,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:32,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 09:20:32,373 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:32,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash -671828333, now seen corresponding path program 1 times [2025-02-08 09:20:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:32,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292897520] [2025-02-08 09:20:32,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:32,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 09:20:32,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 09:20:32,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:32,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:32,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292897520] [2025-02-08 09:20:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292897520] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584098007] [2025-02-08 09:20:32,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:32,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:32,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:32,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:32,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 09:20:32,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 09:20:32,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 09:20:32,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:32,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:32,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:20:32,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:32,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:32,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584098007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:32,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:32,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 09:20:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95081703] [2025-02-08 09:20:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:32,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:32,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:32,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:20:32,520 INFO L87 Difference]: Start difference. First operand 491 states and 591 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:32,608 INFO L93 Difference]: Finished difference Result 498 states and 591 transitions. [2025-02-08 09:20:32,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:20:32,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2025-02-08 09:20:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:32,609 INFO L225 Difference]: With dead ends: 498 [2025-02-08 09:20:32,610 INFO L226 Difference]: Without dead ends: 490 [2025-02-08 09:20:32,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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-02-08 09:20:32,610 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 474 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:32,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 393 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:20:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-08 09:20:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 483. [2025-02-08 09:20:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 346 states have (on average 1.546242774566474) internal successors, (535), 457 states have internal predecessors, (535), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-08 09:20:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 581 transitions. [2025-02-08 09:20:32,623 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 581 transitions. Word has length 90 [2025-02-08 09:20:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:32,623 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 581 transitions. [2025-02-08 09:20:32,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 09:20:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 581 transitions. [2025-02-08 09:20:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 09:20:32,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:32,623 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 09:20:32,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:32,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:32,824 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:32,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 648158413, now seen corresponding path program 1 times [2025-02-08 09:20:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732500711] [2025-02-08 09:20:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:32,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 09:20:32,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 09:20:32,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:32,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732500711] [2025-02-08 09:20:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732500711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221816212] [2025-02-08 09:20:32,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:32,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:32,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:32,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:32,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 09:20:32,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 09:20:32,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 09:20:32,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:32,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:32,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:20:32,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:32,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221816212] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:20:33,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:20:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 09:20:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901603812] [2025-02-08 09:20:33,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:20:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:20:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:20:33,061 INFO L87 Difference]: Start difference. First operand 483 states and 581 transitions. Second operand has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-08 09:20:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:33,203 INFO L93 Difference]: Finished difference Result 844 states and 1034 transitions. [2025-02-08 09:20:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:20:33,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 91 [2025-02-08 09:20:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:33,206 INFO L225 Difference]: With dead ends: 844 [2025-02-08 09:20:33,206 INFO L226 Difference]: Without dead ends: 836 [2025-02-08 09:20:33,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:20:33,207 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 865 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:33,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 976 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:20:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-02-08 09:20:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 554. [2025-02-08 09:20:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 417 states have (on average 1.5227817745803358) internal successors, (635), 523 states have internal predecessors, (635), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-08 09:20:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 691 transitions. [2025-02-08 09:20:33,222 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 691 transitions. Word has length 91 [2025-02-08 09:20:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:33,222 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 691 transitions. [2025-02-08 09:20:33,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-08 09:20:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 691 transitions. [2025-02-08 09:20:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 09:20:33,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:33,223 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:33,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 09:20:33,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:33,427 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:33,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -429332231, now seen corresponding path program 1 times [2025-02-08 09:20:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:33,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628954007] [2025-02-08 09:20:33,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:33,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 09:20:33,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 09:20:33,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-08 09:20:33,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:33,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628954007] [2025-02-08 09:20:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628954007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:33,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:33,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:20:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426868297] [2025-02-08 09:20:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:33,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:20:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:33,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:20:33,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:33,475 INFO L87 Difference]: Start difference. First operand 554 states and 691 transitions. Second operand has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:20:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:33,537 INFO L93 Difference]: Finished difference Result 554 states and 691 transitions. [2025-02-08 09:20:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 100 [2025-02-08 09:20:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:33,539 INFO L225 Difference]: With dead ends: 554 [2025-02-08 09:20:33,539 INFO L226 Difference]: Without dead ends: 552 [2025-02-08 09:20:33,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:20:33,540 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 167 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:33,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 247 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:20:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-08 09:20:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-08 09:20:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 417 states have (on average 1.513189448441247) internal successors, (631), 521 states have internal predecessors, (631), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-08 09:20:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 687 transitions. [2025-02-08 09:20:33,552 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 687 transitions. Word has length 100 [2025-02-08 09:20:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:33,552 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 687 transitions. [2025-02-08 09:20:33,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:20:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 687 transitions. [2025-02-08 09:20:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 09:20:33,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:33,553 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:33,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 09:20:33,554 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:33,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:33,554 INFO L85 PathProgramCache]: Analyzing trace with hash -424397143, now seen corresponding path program 1 times [2025-02-08 09:20:33,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:33,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442267612] [2025-02-08 09:20:33,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:33,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:33,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 09:20:33,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 09:20:33,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:33,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999544389] [2025-02-08 09:20:33,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:33,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:33,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:33,566 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:33,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 09:20:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 09:20:33,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 09:20:33,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:33,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:33,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:20:33,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:34,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442267612] [2025-02-08 09:20:34,652 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999544389] [2025-02-08 09:20:34,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999544389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:34,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-02-08 09:20:34,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777581004] [2025-02-08 09:20:34,653 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:34,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:20:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:34,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:20:34,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:20:34,653 INFO L87 Difference]: Start difference. First operand 552 states and 687 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:35,272 INFO L93 Difference]: Finished difference Result 776 states and 1005 transitions. [2025-02-08 09:20:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:20:35,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 101 [2025-02-08 09:20:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:35,275 INFO L225 Difference]: With dead ends: 776 [2025-02-08 09:20:35,275 INFO L226 Difference]: Without dead ends: 770 [2025-02-08 09:20:35,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:20:35,276 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 230 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:35,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 448 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 09:20:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-02-08 09:20:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 704. [2025-02-08 09:20:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 559 states have (on average 1.5706618962432917) internal successors, (878), 663 states have internal predecessors, (878), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-08 09:20:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 954 transitions. [2025-02-08 09:20:35,295 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 954 transitions. Word has length 101 [2025-02-08 09:20:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:35,295 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 954 transitions. [2025-02-08 09:20:35,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 954 transitions. [2025-02-08 09:20:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 09:20:35,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:35,296 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:35,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:35,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:35,496 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:35,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash 315059820, now seen corresponding path program 1 times [2025-02-08 09:20:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375460021] [2025-02-08 09:20:35,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:35,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 09:20:35,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 09:20:35,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:35,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:35,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:35,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375460021] [2025-02-08 09:20:35,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375460021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:35,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978778106] [2025-02-08 09:20:35,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:35,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:35,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:35,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 09:20:35,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 09:20:35,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 09:20:35,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:35,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:35,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:20:35,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-08 09:20:35,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978778106] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:20:35,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:20:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2025-02-08 09:20:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410908878] [2025-02-08 09:20:35,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:35,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 09:20:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:35,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 09:20:35,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:20:35,800 INFO L87 Difference]: Start difference. First operand 704 states and 954 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 09:20:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:35,856 INFO L93 Difference]: Finished difference Result 788 states and 982 transitions. [2025-02-08 09:20:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:20:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-02-08 09:20:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:35,858 INFO L225 Difference]: With dead ends: 788 [2025-02-08 09:20:35,858 INFO L226 Difference]: Without dead ends: 288 [2025-02-08 09:20:35,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:20:35,859 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 164 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:35,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 881 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:20:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-08 09:20:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-02-08 09:20:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 272 states have internal predecessors, (279), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 09:20:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 305 transitions. [2025-02-08 09:20:35,867 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 305 transitions. Word has length 102 [2025-02-08 09:20:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:35,867 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 305 transitions. [2025-02-08 09:20:35,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-08 09:20:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 305 transitions. [2025-02-08 09:20:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 09:20:35,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:35,868 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:35,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 09:20:36,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:36,069 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:36,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash -271409417, now seen corresponding path program 1 times [2025-02-08 09:20:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:36,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013982198] [2025-02-08 09:20:36,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 09:20:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 09:20:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:36,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991469723] [2025-02-08 09:20:36,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:36,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:36,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:36,083 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:36,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 09:20:36,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 09:20:36,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 09:20:36,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:36,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:36,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 09:20:36,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:36,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013982198] [2025-02-08 09:20:37,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991469723] [2025-02-08 09:20:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991469723] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:37,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-02-08 09:20:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055162168] [2025-02-08 09:20:37,024 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:37,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:20:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:37,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:20:37,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:20:37,025 INFO L87 Difference]: Start difference. First operand 288 states and 305 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:37,424 INFO L93 Difference]: Finished difference Result 291 states and 305 transitions. [2025-02-08 09:20:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:20:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 102 [2025-02-08 09:20:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:37,425 INFO L225 Difference]: With dead ends: 291 [2025-02-08 09:20:37,425 INFO L226 Difference]: Without dead ends: 283 [2025-02-08 09:20:37,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:20:37,426 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 157 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:37,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 232 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:20:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-08 09:20:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-02-08 09:20:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 209 states have (on average 1.2966507177033493) internal successors, (271), 267 states have internal predecessors, (271), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 09:20:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 297 transitions. [2025-02-08 09:20:37,440 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 297 transitions. Word has length 102 [2025-02-08 09:20:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:37,441 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 297 transitions. [2025-02-08 09:20:37,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 297 transitions. [2025-02-08 09:20:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 09:20:37,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:37,441 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:37,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 09:20:37,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 09:20:37,642 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:37,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash 176242791, now seen corresponding path program 1 times [2025-02-08 09:20:37,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:37,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869423062] [2025-02-08 09:20:37,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:37,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:37,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 09:20:37,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 09:20:37,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:37,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493927626] [2025-02-08 09:20:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:37,657 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:37,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 09:20:37,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 09:20:37,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 09:20:37,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:37,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:37,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:20:37,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:37,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869423062] [2025-02-08 09:20:42,128 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493927626] [2025-02-08 09:20:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493927626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:42,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:42,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-02-08 09:20:42,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178483513] [2025-02-08 09:20:42,128 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:42,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:20:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:42,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:20:42,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=34, Unknown=1, NotChecked=0, Total=56 [2025-02-08 09:20:42,129 INFO L87 Difference]: Start difference. First operand 283 states and 297 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:42,502 INFO L93 Difference]: Finished difference Result 283 states and 297 transitions. [2025-02-08 09:20:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:20:42,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 103 [2025-02-08 09:20:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:42,503 INFO L225 Difference]: With dead ends: 283 [2025-02-08 09:20:42,503 INFO L226 Difference]: Without dead ends: 275 [2025-02-08 09:20:42,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=37, Invalid=52, Unknown=1, NotChecked=0, Total=90 [2025-02-08 09:20:42,504 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 217 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:42,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 177 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:20:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-08 09:20:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-08 09:20:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 209 states have (on average 1.2583732057416268) internal successors, (263), 259 states have internal predecessors, (263), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 09:20:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 289 transitions. [2025-02-08 09:20:42,511 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 289 transitions. Word has length 103 [2025-02-08 09:20:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:42,511 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 289 transitions. [2025-02-08 09:20:42,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 289 transitions. [2025-02-08 09:20:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 09:20:42,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:42,512 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:42,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:42,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 09:20:42,712 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2093345583, now seen corresponding path program 1 times [2025-02-08 09:20:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453794223] [2025-02-08 09:20:42,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:42,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 09:20:42,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 09:20:42,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:42,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:42,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843232225] [2025-02-08 09:20:42,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:42,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:42,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:42,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:42,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 09:20:42,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 09:20:42,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 09:20:42,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:42,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:42,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:20:42,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 09:20:42,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453794223] [2025-02-08 09:20:42,856 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843232225] [2025-02-08 09:20:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843232225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:42,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:42,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:20:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67625531] [2025-02-08 09:20:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:42,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:42,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:20:42,858 INFO L87 Difference]: Start difference. First operand 275 states and 289 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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-02-08 09:20:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:43,018 INFO L93 Difference]: Finished difference Result 276 states and 289 transitions. [2025-02-08 09:20:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:20:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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 104 [2025-02-08 09:20:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:43,020 INFO L225 Difference]: With dead ends: 276 [2025-02-08 09:20:43,020 INFO L226 Difference]: Without dead ends: 275 [2025-02-08 09:20:43,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 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-02-08 09:20:43,020 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 149 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:43,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 269 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-08 09:20:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-08 09:20:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 209 states have (on average 1.2535885167464116) internal successors, (262), 259 states have internal predecessors, (262), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 09:20:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 288 transitions. [2025-02-08 09:20:43,028 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 288 transitions. Word has length 104 [2025-02-08 09:20:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:43,028 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 288 transitions. [2025-02-08 09:20:43,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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-02-08 09:20:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 288 transitions. [2025-02-08 09:20:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 09:20:43,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:43,028 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:43,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 09:20:43,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:43,229 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:43,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1168559349, now seen corresponding path program 1 times [2025-02-08 09:20:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602144486] [2025-02-08 09:20:43,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:43,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 09:20:43,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 09:20:43,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:43,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403864728] [2025-02-08 09:20:43,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:43,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:43,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:43,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:43,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 09:20:43,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 09:20:43,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 09:20:43,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:43,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:43,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 09:20:43,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:43,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602144486] [2025-02-08 09:20:43,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403864728] [2025-02-08 09:20:43,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403864728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:43,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:43,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-02-08 09:20:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094682521] [2025-02-08 09:20:43,782 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:43,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 09:20:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:43,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 09:20:43,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:20:43,783 INFO L87 Difference]: Start difference. First operand 275 states and 288 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:44,033 INFO L93 Difference]: Finished difference Result 277 states and 288 transitions. [2025-02-08 09:20:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:20:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 104 [2025-02-08 09:20:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:44,034 INFO L225 Difference]: With dead ends: 277 [2025-02-08 09:20:44,034 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 09:20:44,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:20:44,035 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 191 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:44,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 190 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 09:20:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-08 09:20:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 170 states have (on average 1.2117647058823529) internal successors, (206), 205 states have internal predecessors, (206), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 09:20:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 230 transitions. [2025-02-08 09:20:44,041 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 230 transitions. Word has length 104 [2025-02-08 09:20:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:44,042 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 230 transitions. [2025-02-08 09:20:44,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:20:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 230 transitions. [2025-02-08 09:20:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 09:20:44,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:44,042 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:44,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:44,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:44,243 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:44,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash 469203740, now seen corresponding path program 1 times [2025-02-08 09:20:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:44,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790138512] [2025-02-08 09:20:44,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:44,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 09:20:44,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:20:44,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:44,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719080040] [2025-02-08 09:20:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:44,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:44,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:44,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:44,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 09:20:44,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 09:20:44,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:20:44,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:44,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:44,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:20:44,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 09:20:44,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:20:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790138512] [2025-02-08 09:20:44,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719080040] [2025-02-08 09:20:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719080040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:20:44,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:20:44,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:20:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282556371] [2025-02-08 09:20:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:20:44,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:20:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:44,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:20:44,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:20:44,448 INFO L87 Difference]: Start difference. First operand 220 states and 230 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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-02-08 09:20:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:44,654 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2025-02-08 09:20:44,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:20:44,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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 105 [2025-02-08 09:20:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:44,655 INFO L225 Difference]: With dead ends: 221 [2025-02-08 09:20:44,655 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 09:20:44,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-02-08 09:20:44,655 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:44,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 278 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 09:20:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 09:20:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.230263157894737) internal successors, (187), 187 states have internal predecessors, (187), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:20:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 207 transitions. [2025-02-08 09:20:44,661 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 207 transitions. Word has length 105 [2025-02-08 09:20:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:44,661 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 207 transitions. [2025-02-08 09:20:44,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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-02-08 09:20:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 207 transitions. [2025-02-08 09:20:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 09:20:44,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:44,662 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:44,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:44,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 09:20:44,862 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:44,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1865601573, now seen corresponding path program 1 times [2025-02-08 09:20:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:44,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736345411] [2025-02-08 09:20:44,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:44,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:44,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 09:20:44,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:20:44,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:44,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53631448] [2025-02-08 09:20:44,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:44,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:44,879 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:44,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 09:20:44,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 09:20:44,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:20:44,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:44,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:44,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 09:20:44,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:46,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:20:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736345411] [2025-02-08 09:20:46,434 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53631448] [2025-02-08 09:20:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53631448] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:20:46,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:20:46,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 09:20:46,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128862450] [2025-02-08 09:20:46,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:46,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:20:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:46,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:20:46,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:20:46,436 INFO L87 Difference]: Start difference. First operand 200 states and 207 transitions. Second operand has 10 states, 9 states have (on average 17.0) internal successors, (153), 10 states have internal predecessors, (153), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-08 09:20:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:46,843 INFO L93 Difference]: Finished difference Result 200 states and 207 transitions. [2025-02-08 09:20:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 09:20:46,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.0) internal successors, (153), 10 states have internal predecessors, (153), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2025-02-08 09:20:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:46,845 INFO L225 Difference]: With dead ends: 200 [2025-02-08 09:20:46,845 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 09:20:46,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-08 09:20:46,845 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 326 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:46,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 117 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:20:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 09:20:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-08 09:20:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.1712328767123288) internal successors, (171), 171 states have internal predecessors, (171), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:20:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 191 transitions. [2025-02-08 09:20:46,851 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 191 transitions. Word has length 105 [2025-02-08 09:20:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:46,852 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 191 transitions. [2025-02-08 09:20:46,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.0) internal successors, (153), 10 states have internal predecessors, (153), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-08 09:20:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 191 transitions. [2025-02-08 09:20:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 09:20:46,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:46,853 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:46,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 09:20:47,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 09:20:47,053 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:47,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1555047060, now seen corresponding path program 1 times [2025-02-08 09:20:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785751773] [2025-02-08 09:20:47,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:47,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 09:20:47,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 09:20:47,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:47,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 09:20:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785751773] [2025-02-08 09:20:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785751773] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008417233] [2025-02-08 09:20:47,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:47,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:47,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 09:20:47,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 09:20:47,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 09:20:47,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:47,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 09:20:47,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 09:20:47,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-08 09:20:47,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008417233] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:20:47,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:20:47,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 09:20:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527294297] [2025-02-08 09:20:47,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:47,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:20:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:47,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:20:47,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:20:47,431 INFO L87 Difference]: Start difference. First operand 184 states and 191 transitions. Second operand has 7 states, 6 states have (on average 39.5) internal successors, (237), 7 states have internal predecessors, (237), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-02-08 09:20:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:47,578 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2025-02-08 09:20:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 09:20:47,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.5) internal successors, (237), 7 states have internal predecessors, (237), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 123 [2025-02-08 09:20:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:47,579 INFO L225 Difference]: With dead ends: 184 [2025-02-08 09:20:47,579 INFO L226 Difference]: Without dead ends: 174 [2025-02-08 09:20:47,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:20:47,580 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 76 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:47,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 149 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:20:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-08 09:20:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-02-08 09:20:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 144 states have (on average 1.1180555555555556) internal successors, (161), 161 states have internal predecessors, (161), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:20:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 181 transitions. [2025-02-08 09:20:47,586 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 181 transitions. Word has length 123 [2025-02-08 09:20:47,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:47,586 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 181 transitions. [2025-02-08 09:20:47,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.5) internal successors, (237), 7 states have internal predecessors, (237), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-02-08 09:20:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 181 transitions. [2025-02-08 09:20:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-08 09:20:47,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:47,587 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:47,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 09:20:47,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:47,791 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:47,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -961818511, now seen corresponding path program 1 times [2025-02-08 09:20:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:47,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836805881] [2025-02-08 09:20:47,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:47,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 09:20:47,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 09:20:47,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:47,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706665168] [2025-02-08 09:20:47,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:47,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:47,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:47,811 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:47,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 09:20:47,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 09:20:47,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 09:20:47,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:47,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:47,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 09:20:47,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 09:20:48,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:48,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:48,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836805881] [2025-02-08 09:20:48,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:48,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706665168] [2025-02-08 09:20:48,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706665168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:20:48,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:20:48,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-08 09:20:48,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122243418] [2025-02-08 09:20:48,374 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:48,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 09:20:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:48,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 09:20:48,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:20:48,375 INFO L87 Difference]: Start difference. First operand 174 states and 181 transitions. Second operand has 9 states, 8 states have (on average 11.875) internal successors, (95), 9 states have internal predecessors, (95), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:20:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:48,676 INFO L93 Difference]: Finished difference Result 178 states and 185 transitions. [2025-02-08 09:20:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 09:20:48,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.875) internal successors, (95), 9 states have internal predecessors, (95), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 124 [2025-02-08 09:20:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:48,677 INFO L225 Difference]: With dead ends: 178 [2025-02-08 09:20:48,677 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 09:20:48,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 09:20:48,678 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 107 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:48,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 296 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:20:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 09:20:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-02-08 09:20:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.0) internal successors, (143), 143 states have internal predecessors, (143), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:20:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2025-02-08 09:20:48,686 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 124 [2025-02-08 09:20:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:48,687 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2025-02-08 09:20:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.875) internal successors, (95), 9 states have internal predecessors, (95), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:20:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2025-02-08 09:20:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-08 09:20:48,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:20:48,687 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:48,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 09:20:48,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:48,892 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-02-08 09:20:48,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:20:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash -476578189, now seen corresponding path program 1 times [2025-02-08 09:20:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:20:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448780565] [2025-02-08 09:20:48,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:20:48,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 09:20:48,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 09:20:48,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:48,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:20:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105280009] [2025-02-08 09:20:48,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:20:48,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:20:48,924 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:20:48,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 09:20:48,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 09:20:48,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 09:20:48,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:20:48,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:20:48,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 09:20:48,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:20:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-08 09:20:49,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:20:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-08 09:20:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:20:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448780565] [2025-02-08 09:20:49,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:20:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105280009] [2025-02-08 09:20:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105280009] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:20:49,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:20:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 09:20:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516046795] [2025-02-08 09:20:49,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:20:49,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:20:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:20:49,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:20:49,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:20:49,754 INFO L87 Difference]: Start difference. First operand 156 states and 163 transitions. Second operand has 10 states, 9 states have (on average 30.77777777777778) internal successors, (277), 10 states have internal predecessors, (277), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-08 09:20:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:20:49,941 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2025-02-08 09:20:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:20:49,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 30.77777777777778) internal successors, (277), 10 states have internal predecessors, (277), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 187 [2025-02-08 09:20:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:20:49,942 INFO L225 Difference]: With dead ends: 156 [2025-02-08 09:20:49,942 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:20:49,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:20:49,942 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:20:49,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:20:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:20:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:20:49,944 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-02-08 09:20:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:20:49,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2025-02-08 09:20:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:20:49,944 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:20:49,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 30.77777777777778) internal successors, (277), 10 states have internal predecessors, (277), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-08 09:20:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:20:49,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 140 remaining) [2025-02-08 09:20:49,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 140 remaining) [2025-02-08 09:20:49,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 140 remaining) [2025-02-08 09:20:49,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 140 remaining) [2025-02-08 09:20:49,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 140 remaining) [2025-02-08 09:20:49,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 140 remaining) [2025-02-08 09:20:49,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 140 remaining) [2025-02-08 09:20:49,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-08 09:20:50,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:20:50,155 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:20:50,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:20:50,580 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:20:50,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:20:50 BoogieIcfgContainer [2025-02-08 09:20:50,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:20:50,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:20:50,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:20:50,595 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:20:50,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:20:22" (3/4) ... [2025-02-08 09:20:50,597 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:20:50,603 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 09:20:50,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 09:20:50,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:20:50,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:20:50,611 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:20:50,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:20:50,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:20:50,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:20:50,679 INFO L158 Benchmark]: Toolchain (without parser) took 28961.75ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 106.2MB in the beginning and 205.0MB in the end (delta: -98.8MB). Peak memory consumption was 261.5MB. Max. memory is 16.1GB. [2025-02-08 09:20:50,679 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:20:50,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.57ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 94.9MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:20:50,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.2MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:20:50,681 INFO L158 Benchmark]: Boogie Preprocessor took 42.00ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.3MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:20:50,681 INFO L158 Benchmark]: IcfgBuilder took 710.61ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 52.0MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 09:20:50,681 INFO L158 Benchmark]: TraceAbstraction took 27898.29ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 52.0MB in the beginning and 217.5MB in the end (delta: -165.5MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. [2025-02-08 09:20:50,681 INFO L158 Benchmark]: Witness Printer took 83.58ms. Allocated memory is still 503.3MB. Free memory was 213.3MB in the beginning and 205.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:20:50,682 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.14ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.57ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 94.9MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.2MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.00ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 91.3MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 710.61ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 52.0MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27898.29ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 52.0MB in the beginning and 217.5MB in the end (delta: -165.5MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. * Witness Printer took 83.58ms. Allocated memory is still 503.3MB. Free memory was 213.3MB in the beginning and 205.0MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: 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: 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: 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: 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: 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: 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: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 302 locations, 140 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 32, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6445 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6291 mSDsluCounter, 14465 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7446 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10351 IncrementalHoareTripleChecker+Invalid, 10720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 7019 mSDtfsCounter, 10351 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2580 GetRequests, 2444 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=704occurred in iteration=22, InterpolantAutomatonStates: 146, 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, 32 MinimizatonAttempts, 753 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 4385 NumberOfCodeBlocks, 4385 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 3740 ConstructedInterpolants, 9 QuantifiedInterpolants, 22927 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2984 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 43 InterpolantComputations, 22 PerfectInterpolantSequences, 2267/2349 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 140 specifications checked. All of them hold - InvariantResult [Line: 33]: Location Invariant Derived location invariant: ((((((((7 == y) && (z == 12)) && (x == 1)) && (n == 1)) && (0 <= a)) && (counter == 1)) && (a <= 32767)) || ((((((y == 1) && (counter == 0)) && ((((a + 1) <= 0) && (0 <= (a + 32768))) || ((0 <= a) && (a <= 32767)))) && (n == 0)) && (x == 0)) && (6 == z))) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:20:50,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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