./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/ps5-ll_valuebound2.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 1c1067a232ccde2ed577e0679695f102973a28bf8615edad0a3c87e54d273eb4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:25:42,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:25:42,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:25:42,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:25:42,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:25:42,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:25:42,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:25:42,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:25:42,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:25:42,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:25:42,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:25:42,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:25:42,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:25:42,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:25:42,643 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:25:42,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:25:42,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:25:42,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:25:42,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:25:42,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:25:42,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:25:42,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:25:42,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:25:42,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:25:42,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:25:42,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:25:42,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:25:42,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:25:42,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:25:42,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:25:42,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:25:42,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:25:42,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:25:42,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:25:42,647 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 -> 1c1067a232ccde2ed577e0679695f102973a28bf8615edad0a3c87e54d273eb4 [2025-02-06 14:25:42,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:25:42,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:25:42,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:25:42,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:25:42,832 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:25:42,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound2.c [2025-02-06 14:25:43,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/483cba24f/26f723946b144467b41d3852a5568c4a/FLAGfb0bc1218 [2025-02-06 14:25:44,187 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:25:44,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound2.c [2025-02-06 14:25:44,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/483cba24f/26f723946b144467b41d3852a5568c4a/FLAGfb0bc1218 [2025-02-06 14:25:44,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/483cba24f/26f723946b144467b41d3852a5568c4a [2025-02-06 14:25:44,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:25:44,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:25:44,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:25:44,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:25:44,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:25:44,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44, skipping insertion in model container [2025-02-06 14:25:44,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:25:44,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:25:44,655 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:25:44,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:25:44,681 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:25:44,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44 WrapperNode [2025-02-06 14:25:44,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:25:44,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:25:44,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:25:44,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:25:44,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,707 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-02-06 14:25:44,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:25:44,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:25:44,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:25:44,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:25:44,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,723 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-06 14:25:44,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:25:44,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:25:44,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:25:44,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:25:44,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (1/1) ... [2025-02-06 14:25:44,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:25:44,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:44,749 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-06 14:25:44,753 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-06 14:25:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:25:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 14:25:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 14:25:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:25:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:25:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:25:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:25:44,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:25:44,800 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:25:44,802 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:25:45,161 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-06 14:25:45,161 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:25:45,175 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:25:45,175 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:25:45,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:45 BoogieIcfgContainer [2025-02-06 14:25:45,175 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:25:45,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:25:45,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:25:45,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:25:45,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:25:44" (1/3) ... [2025-02-06 14:25:45,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5697d896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:25:45, skipping insertion in model container [2025-02-06 14:25:45,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:44" (2/3) ... [2025-02-06 14:25:45,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5697d896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:25:45, skipping insertion in model container [2025-02-06 14:25:45,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:45" (3/3) ... [2025-02-06 14:25:45,191 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound2.c [2025-02-06 14:25:45,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:25:45,205 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_valuebound2.c that has 3 procedures, 192 locations, 1 initial locations, 1 loop locations, and 84 error locations. [2025-02-06 14:25:45,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:25:45,255 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;@3e0e51a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:25:45,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-02-06 14:25:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 100 states have (on average 1.88) internal successors, (188), 184 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:25:45,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:45,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:45,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:45,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 603286069, now seen corresponding path program 1 times [2025-02-06 14:25:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:45,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792309626] [2025-02-06 14:25:45,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:45,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:25:45,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:25:45,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:45,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:25:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792309626] [2025-02-06 14:25:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792309626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:25:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868214497] [2025-02-06 14:25:45,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:45,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:45,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:45,368 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-06 14:25:45,370 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-06 14:25:45,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:25:45,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:25:45,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:45,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:45,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 14:25:45,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:25:45,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:25:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868214497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:25:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 14:25:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079968037] [2025-02-06 14:25:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:45,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:25:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:45,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:25:45,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:25:45,443 INFO L87 Difference]: Start difference. First operand has 192 states, 100 states have (on average 1.88) internal successors, (188), 184 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:25:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:45,466 INFO L93 Difference]: Finished difference Result 367 states and 396 transitions. [2025-02-06 14:25:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:25:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-02-06 14:25:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:45,472 INFO L225 Difference]: With dead ends: 367 [2025-02-06 14:25:45,473 INFO L226 Difference]: Without dead ends: 172 [2025-02-06 14:25:45,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:25:45,479 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:45,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:25:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-06 14:25:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-02-06 14:25:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 95 states have (on average 1.7473684210526317) internal successors, (166), 165 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:25:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2025-02-06 14:25:45,520 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 15 [2025-02-06 14:25:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:45,520 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2025-02-06 14:25:45,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:25:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2025-02-06 14:25:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:25:45,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:45,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:45,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:25:45,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 14:25:45,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:45,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1165036139, now seen corresponding path program 1 times [2025-02-06 14:25:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-02-06 14:25:45,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:45,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:25:45,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:25:45,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:45,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-02-06 14:25:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232696962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:45,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:45,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366324856] [2025-02-06 14:25:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:45,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:45,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:45,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:45,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:45,775 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:46,080 INFO L93 Difference]: Finished difference Result 309 states and 321 transitions. [2025-02-06 14:25:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:46,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-02-06 14:25:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:46,081 INFO L225 Difference]: With dead ends: 309 [2025-02-06 14:25:46,081 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 14:25:46,082 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-06 14:25:46,082 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 82 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:46,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 127 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:25:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 14:25:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2025-02-06 14:25:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 169 states have (on average 1.5029585798816567) internal successors, (254), 239 states have internal predecessors, (254), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 264 transitions. [2025-02-06 14:25:46,092 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 264 transitions. Word has length 15 [2025-02-06 14:25:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:46,093 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 264 transitions. [2025-02-06 14:25:46,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 264 transitions. [2025-02-06 14:25:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:25:46,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:46,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:46,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:25:46,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:46,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -569588615, now seen corresponding path program 1 times [2025-02-06 14:25:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507565463] [2025-02-06 14:25:46,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:25:46,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:25:46,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:46,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:46,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507565463] [2025-02-06 14:25:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507565463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:46,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:46,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:46,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476091697] [2025-02-06 14:25:46,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:46,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:46,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:46,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:46,218 INFO L87 Difference]: Start difference. First operand 247 states and 264 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:46,286 INFO L93 Difference]: Finished difference Result 266 states and 278 transitions. [2025-02-06 14:25:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-02-06 14:25:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:46,287 INFO L225 Difference]: With dead ends: 266 [2025-02-06 14:25:46,287 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 14:25:46,288 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-06 14:25:46,290 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:46,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 296 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:25:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 14:25:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2025-02-06 14:25:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.4829545454545454) internal successors, (261), 246 states have internal predecessors, (261), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2025-02-06 14:25:46,304 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 43 [2025-02-06 14:25:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:46,304 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2025-02-06 14:25:46,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2025-02-06 14:25:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 14:25:46,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:46,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:25:46,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1913809673, now seen corresponding path program 1 times [2025-02-06 14:25:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070261318] [2025-02-06 14:25:46,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:46,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 14:25:46,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 14:25:46,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:46,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070261318] [2025-02-06 14:25:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070261318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717075754] [2025-02-06 14:25:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:46,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:46,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:46,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:46,407 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:46,688 INFO L93 Difference]: Finished difference Result 265 states and 273 transitions. [2025-02-06 14:25:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:46,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-02-06 14:25:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:46,690 INFO L225 Difference]: With dead ends: 265 [2025-02-06 14:25:46,690 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 14:25:46,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 14:25:46,691 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 81 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:46,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 255 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:25:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 14:25:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2025-02-06 14:25:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 246 states have internal predecessors, (256), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 266 transitions. [2025-02-06 14:25:46,698 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 266 transitions. Word has length 45 [2025-02-06 14:25:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:46,698 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 266 transitions. [2025-02-06 14:25:46,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 266 transitions. [2025-02-06 14:25:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 14:25:46,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:46,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:46,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:25:46,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:46,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash 801442363, now seen corresponding path program 1 times [2025-02-06 14:25:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:46,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205995163] [2025-02-06 14:25:46,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:46,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:46,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 14:25:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 14:25:46,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205995163] [2025-02-06 14:25:46,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205995163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:46,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:46,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466668800] [2025-02-06 14:25:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:46,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:46,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:46,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:46,769 INFO L87 Difference]: Start difference. First operand 254 states and 266 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:46,902 INFO L93 Difference]: Finished difference Result 264 states and 268 transitions. [2025-02-06 14:25:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:46,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-02-06 14:25:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:46,903 INFO L225 Difference]: With dead ends: 264 [2025-02-06 14:25:46,903 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 14:25:46,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 14:25:46,904 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:46,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 246 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:25:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 14:25:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2025-02-06 14:25:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 212 states have internal predecessors, (218), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 228 transitions. [2025-02-06 14:25:46,910 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 228 transitions. Word has length 46 [2025-02-06 14:25:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:46,910 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 228 transitions. [2025-02-06 14:25:46,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 228 transitions. [2025-02-06 14:25:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:25:46,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:46,911 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 14:25:46,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:25:46,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:46,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1176305615, now seen corresponding path program 1 times [2025-02-06 14:25:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:46,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036741552] [2025-02-06 14:25:46,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:46,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:25:46,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:25:46,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:46,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:46,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036741552] [2025-02-06 14:25:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036741552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:46,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611047314] [2025-02-06 14:25:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:46,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:46,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:46,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:46,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:46,970 INFO L87 Difference]: Start difference. First operand 220 states and 228 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:46,981 INFO L93 Difference]: Finished difference Result 222 states and 228 transitions. [2025-02-06 14:25:46,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2025-02-06 14:25:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:46,983 INFO L225 Difference]: With dead ends: 222 [2025-02-06 14:25:46,983 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 14:25:46,983 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-06 14:25:46,983 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 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-06 14:25:46,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:25:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 14:25:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-06 14:25:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 212 states have internal predecessors, (216), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 226 transitions. [2025-02-06 14:25:46,989 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 226 transitions. Word has length 55 [2025-02-06 14:25:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:46,990 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 226 transitions. [2025-02-06 14:25:46,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 226 transitions. [2025-02-06 14:25:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 14:25:46,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:46,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 14:25:46,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:25:46,991 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:46,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1403214962, now seen corresponding path program 1 times [2025-02-06 14:25:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422783597] [2025-02-06 14:25:46,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:46,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:25:47,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:25:47,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:47,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:47,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [911307042] [2025-02-06 14:25:47,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:47,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:47,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:47,009 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-06 14:25:47,010 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-06 14:25:47,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:25:47,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:25:47,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:47,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:47,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:25:47,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:47,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:25:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422783597] [2025-02-06 14:25:47,132 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911307042] [2025-02-06 14:25:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911307042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:47,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:47,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:47,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367659588] [2025-02-06 14:25:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:47,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:47,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:47,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:47,133 INFO L87 Difference]: Start difference. First operand 220 states and 226 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:47,420 INFO L93 Difference]: Finished difference Result 359 states and 375 transitions. [2025-02-06 14:25:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:47,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2025-02-06 14:25:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:47,422 INFO L225 Difference]: With dead ends: 359 [2025-02-06 14:25:47,422 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 14:25:47,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:47,422 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 90 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:47,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 153 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:25:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 14:25:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2025-02-06 14:25:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 219 states have (on average 1.4018264840182648) internal successors, (307), 289 states have internal predecessors, (307), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 321 transitions. [2025-02-06 14:25:47,429 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 321 transitions. Word has length 60 [2025-02-06 14:25:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:47,429 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 321 transitions. [2025-02-06 14:25:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 321 transitions. [2025-02-06 14:25:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 14:25:47,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:47,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 14:25:47,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:25:47,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:47,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:47,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2069461556, now seen corresponding path program 1 times [2025-02-06 14:25:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-02-06 14:25:47,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:47,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 14:25:47,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 14:25:47,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:47,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:47,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208112992] [2025-02-06 14:25:47,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208112992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:47,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:47,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392781202] [2025-02-06 14:25:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:47,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:47,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:47,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:47,747 INFO L87 Difference]: Start difference. First operand 299 states and 321 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:47,811 INFO L93 Difference]: Finished difference Result 300 states and 321 transitions. [2025-02-06 14:25:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-02-06 14:25:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:47,813 INFO L225 Difference]: With dead ends: 300 [2025-02-06 14:25:47,813 INFO L226 Difference]: Without dead ends: 299 [2025-02-06 14:25:47,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 14:25:47,813 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 39 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:47,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 280 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:25:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-06 14:25:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-02-06 14:25:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 219 states have (on average 1.3972602739726028) internal successors, (306), 289 states have internal predecessors, (306), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 320 transitions. [2025-02-06 14:25:47,822 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 320 transitions. Word has length 66 [2025-02-06 14:25:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:47,822 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 320 transitions. [2025-02-06 14:25:47,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 320 transitions. [2025-02-06 14:25:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 14:25:47,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:47,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:25:47,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:25:47,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:47,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2053706350, now seen corresponding path program 1 times [2025-02-06 14:25:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685290719] [2025-02-06 14:25:47,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:47,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:25:47,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:25:47,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:47,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:47,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486502551] [2025-02-06 14:25:47,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:47,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:47,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:47,871 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-06 14:25:47,871 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-06 14:25:47,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:25:47,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:25:47,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:47,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:47,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:25:47,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 14:25:48,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:25:48,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:48,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685290719] [2025-02-06 14:25:48,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:48,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486502551] [2025-02-06 14:25:48,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486502551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:48,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:48,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957397614] [2025-02-06 14:25:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:48,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:48,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:48,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:48,036 INFO L87 Difference]: Start difference. First operand 299 states and 320 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:48,076 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2025-02-06 14:25:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:48,076 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 96 [2025-02-06 14:25:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:48,077 INFO L225 Difference]: With dead ends: 299 [2025-02-06 14:25:48,077 INFO L226 Difference]: Without dead ends: 296 [2025-02-06 14:25:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:48,077 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:48,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 159 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:25:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-06 14:25:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-06 14:25:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 286 states have internal predecessors, (301), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 315 transitions. [2025-02-06 14:25:48,086 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 315 transitions. Word has length 96 [2025-02-06 14:25:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 315 transitions. [2025-02-06 14:25:48,088 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 315 transitions. [2025-02-06 14:25:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 14:25:48,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:48,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:25:48,099 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-06 14:25:48,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:48,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:48,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash -759612504, now seen corresponding path program 1 times [2025-02-06 14:25:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-06 14:25:48,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:48,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:48,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 14:25:48,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 14:25:48,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:48,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168859061] [2025-02-06 14:25:48,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:48,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:48,317 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-06 14:25:48,318 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-06 14:25:48,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 14:25:48,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 14:25:48,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:48,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:25:48,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:48,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:25:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648740649] [2025-02-06 14:25:48,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168859061] [2025-02-06 14:25:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168859061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:25:48,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:25:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-06 14:25:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565690111] [2025-02-06 14:25:48,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:25:48,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:25:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:48,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:25:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:25:48,690 INFO L87 Difference]: Start difference. First operand 296 states and 315 transitions. Second operand has 8 states, 7 states have (on average 24.0) internal successors, (168), 8 states have internal predecessors, (168), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:25:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:49,329 INFO L93 Difference]: Finished difference Result 368 states and 383 transitions. [2025-02-06 14:25:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:25:49,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 24.0) internal successors, (168), 8 states have internal predecessors, (168), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 97 [2025-02-06 14:25:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:49,331 INFO L225 Difference]: With dead ends: 368 [2025-02-06 14:25:49,331 INFO L226 Difference]: Without dead ends: 361 [2025-02-06 14:25:49,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:25:49,332 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 284 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:49,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 333 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 14:25:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-06 14:25:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 334. [2025-02-06 14:25:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 258 states have (on average 1.3953488372093024) internal successors, (360), 324 states have internal predecessors, (360), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 374 transitions. [2025-02-06 14:25:49,341 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 374 transitions. Word has length 97 [2025-02-06 14:25:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:49,341 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 374 transitions. [2025-02-06 14:25:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 24.0) internal successors, (168), 8 states have internal predecessors, (168), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:25:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 374 transitions. [2025-02-06 14:25:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 14:25:49,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:49,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:25:49,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:25:49,546 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,SelfDestructingSolverStorable9 [2025-02-06 14:25:49,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:49,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2073151060, now seen corresponding path program 1 times [2025-02-06 14:25:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-02-06 14:25:49,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:49,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:49,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:25:49,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:25:49,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:49,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274927039] [2025-02-06 14:25:49,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:49,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:49,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:49,568 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-06 14:25:49,569 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-06 14:25:49,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:25:49,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:25:49,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:49,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:49,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 14:25:49,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:49,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:25:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-02-06 14:25:50,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274927039] [2025-02-06 14:25:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274927039] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 14:25:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:25:50,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-02-06 14:25:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12146482] [2025-02-06 14:25:50,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:50,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:25:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:50,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:25:50,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:25:50,612 INFO L87 Difference]: Start difference. First operand 334 states and 374 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:53,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:57,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:01,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:03,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:05,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:10,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:14,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:20,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:23,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:25,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:25,598 INFO L93 Difference]: Finished difference Result 334 states and 374 transitions. [2025-02-06 14:26:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:26:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2025-02-06 14:26:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:25,600 INFO L225 Difference]: With dead ends: 334 [2025-02-06 14:26:25,600 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 14:26:25,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:26:25,600 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 203 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:25,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 58 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 5 Unknown, 0 Unchecked, 34.9s Time] [2025-02-06 14:26:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 14:26:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-06 14:26:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 258 states have (on average 1.37984496124031) internal successors, (356), 322 states have internal predecessors, (356), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:26:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 370 transitions. [2025-02-06 14:26:25,611 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 370 transitions. Word has length 98 [2025-02-06 14:26:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:25,612 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 370 transitions. [2025-02-06 14:26:25,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:26:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 370 transitions. [2025-02-06 14:26:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 14:26:25,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:25,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:26:25,618 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-06 14:26:25,814 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,SelfDestructingSolverStorable10 [2025-02-06 14:26:25,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:25,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash 156826662, now seen corresponding path program 1 times [2025-02-06 14:26:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:25,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651011271] [2025-02-06 14:26:25,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:25,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:26:25,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:26:25,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:25,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594497917] [2025-02-06 14:26:25,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:25,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:25,855 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-06 14:26:25,857 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-06 14:26:25,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:26:25,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:26:25,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:25,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:25,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:26:25,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:26:26,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:26:26,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651011271] [2025-02-06 14:26:26,013 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:26,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594497917] [2025-02-06 14:26:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594497917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:26,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:26:26,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:26:26,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53170435] [2025-02-06 14:26:26,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:26,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:26:26,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:26,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:26:26,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:26:26,014 INFO L87 Difference]: Start difference. First operand 332 states and 370 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:26:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:26,241 INFO L93 Difference]: Finished difference Result 332 states and 370 transitions. [2025-02-06 14:26:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:26:26,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 99 [2025-02-06 14:26:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:26,242 INFO L225 Difference]: With dead ends: 332 [2025-02-06 14:26:26,242 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 14:26:26,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:26:26,243 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 201 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:26,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 48 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:26:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 14:26:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-02-06 14:26:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 302 states have internal predecessors, (326), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:26:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 340 transitions. [2025-02-06 14:26:26,253 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 340 transitions. Word has length 99 [2025-02-06 14:26:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:26,253 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 340 transitions. [2025-02-06 14:26:26,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:26:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 340 transitions. [2025-02-06 14:26:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 14:26:26,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:26,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:26:26,263 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-06 14:26:26,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 14:26:26,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:26,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash 566659306, now seen corresponding path program 1 times [2025-02-06 14:26:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:26,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698793209] [2025-02-06 14:26:26,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:26,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 14:26:26,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 14:26:26,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:26,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382666873] [2025-02-06 14:26:26,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:26,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:26,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:26,482 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-06 14:26:26,485 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-06 14:26:26,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 14:26:26,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 14:26:26,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:26,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:26,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:26:26,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:26:26,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 14:26:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698793209] [2025-02-06 14:26:26,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382666873] [2025-02-06 14:26:26,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382666873] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:26,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:26:26,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 14:26:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855934982] [2025-02-06 14:26:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:26,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:26:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:26,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:26:26,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:26:26,901 INFO L87 Difference]: Start difference. First operand 312 states and 340 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:26:30,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:34,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:34,866 INFO L93 Difference]: Finished difference Result 312 states and 340 transitions. [2025-02-06 14:26:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:26:34,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2025-02-06 14:26:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:34,869 INFO L225 Difference]: With dead ends: 312 [2025-02-06 14:26:34,869 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 14:26:34,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:26:34,870 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 79 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:34,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 44 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-02-06 14:26:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 14:26:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-02-06 14:26:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 258 states have (on average 1.248062015503876) internal successors, (322), 300 states have internal predecessors, (322), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:26:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 336 transitions. [2025-02-06 14:26:34,880 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 336 transitions. Word has length 100 [2025-02-06 14:26:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:34,881 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 336 transitions. [2025-02-06 14:26:34,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:26:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 336 transitions. [2025-02-06 14:26:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 14:26:34,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:34,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:26:34,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 14:26:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:35,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1486423718, now seen corresponding path program 1 times [2025-02-06 14:26:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913828913] [2025-02-06 14:26:35,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:35,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:35,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 14:26:35,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 14:26:35,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:35,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913828913] [2025-02-06 14:26:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913828913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883442365] [2025-02-06 14:26:35,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:35,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:35,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:35,187 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-06 14:26:35,188 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-06 14:26:35,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 14:26:35,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 14:26:35,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:35,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:35,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:26:35,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:35,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:26:35,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883442365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:35,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:26:35,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 14:26:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158342033] [2025-02-06 14:26:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:35,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:26:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:35,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:26:35,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:26:35,332 INFO L87 Difference]: Start difference. First operand 310 states and 336 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:26:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:35,350 INFO L93 Difference]: Finished difference Result 310 states and 336 transitions. [2025-02-06 14:26:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:26:35,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 108 [2025-02-06 14:26:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:35,352 INFO L225 Difference]: With dead ends: 310 [2025-02-06 14:26:35,352 INFO L226 Difference]: Without dead ends: 309 [2025-02-06 14:26:35,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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-06 14:26:35,352 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 25 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:35,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 350 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:26:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-06 14:26:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-02-06 14:26:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 258 states have (on average 1.2403100775193798) internal successors, (320), 299 states have internal predecessors, (320), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:26:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 334 transitions. [2025-02-06 14:26:35,360 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 334 transitions. Word has length 108 [2025-02-06 14:26:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:35,361 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 334 transitions. [2025-02-06 14:26:35,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:26:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 334 transitions. [2025-02-06 14:26:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 14:26:35,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:35,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:26:35,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:26:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:35,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:35,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:35,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1165504927, now seen corresponding path program 1 times [2025-02-06 14:26:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-02-06 14:26:35,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:35,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 14:26:35,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 14:26:35,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:35,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153447029] [2025-02-06 14:26:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153447029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633492784] [2025-02-06 14:26:35,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:35,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:35,631 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-06 14:26:35,633 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-06 14:26:35,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 14:26:35,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 14:26:35,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:35,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:35,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:26:35,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:35,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633492784] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:26:35,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:26:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 14:26:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506182563] [2025-02-06 14:26:35,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:35,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:26:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:35,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:26:35,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:26:35,842 INFO L87 Difference]: Start difference. First operand 309 states and 334 transitions. Second operand has 7 states, 6 states have (on average 36.833333333333336) internal successors, (221), 7 states have internal predecessors, (221), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-06 14:26:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:35,875 INFO L93 Difference]: Finished difference Result 408 states and 421 transitions. [2025-02-06 14:26:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:26:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.833333333333336) internal successors, (221), 7 states have internal predecessors, (221), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 109 [2025-02-06 14:26:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:35,877 INFO L225 Difference]: With dead ends: 408 [2025-02-06 14:26:35,877 INFO L226 Difference]: Without dead ends: 407 [2025-02-06 14:26:35,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 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-06 14:26:35,877 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 68 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:35,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 667 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:26:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-06 14:26:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2025-02-06 14:26:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 313 states have (on average 1.2779552715654952) internal successors, (400), 354 states have internal predecessors, (400), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:26:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 418 transitions. [2025-02-06 14:26:35,886 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 418 transitions. Word has length 109 [2025-02-06 14:26:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:35,886 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 418 transitions. [2025-02-06 14:26:35,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.833333333333336) internal successors, (221), 7 states have internal predecessors, (221), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-06 14:26:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 418 transitions. [2025-02-06 14:26:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 14:26:35,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:35,887 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:35,894 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-06 14:26:36,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:36,088 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:36,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:36,088 INFO L85 PathProgramCache]: Analyzing trace with hash -616745803, now seen corresponding path program 1 times [2025-02-06 14:26:36,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123795164] [2025-02-06 14:26:36,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:36,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 14:26:36,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 14:26:36,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:36,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 14:26:36,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123795164] [2025-02-06 14:26:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123795164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:26:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:26:36,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536229279] [2025-02-06 14:26:36,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:36,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:26:36,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:36,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:26:36,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:26:36,172 INFO L87 Difference]: Start difference. First operand 366 states and 418 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:36,309 INFO L93 Difference]: Finished difference Result 366 states and 418 transitions. [2025-02-06 14:26:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:26:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2025-02-06 14:26:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:36,311 INFO L225 Difference]: With dead ends: 366 [2025-02-06 14:26:36,312 INFO L226 Difference]: Without dead ends: 359 [2025-02-06 14:26:36,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 14:26:36,312 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:36,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 54 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:26:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-06 14:26:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-02-06 14:26:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 313 states have (on average 1.233226837060703) internal successors, (386), 347 states have internal predecessors, (386), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:26:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 404 transitions. [2025-02-06 14:26:36,323 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 404 transitions. Word has length 121 [2025-02-06 14:26:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:36,324 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 404 transitions. [2025-02-06 14:26:36,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 404 transitions. [2025-02-06 14:26:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 14:26:36,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:36,325 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:26:36,325 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1939250567, now seen corresponding path program 1 times [2025-02-06 14:26:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348194247] [2025-02-06 14:26:36,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:36,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 14:26:36,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 14:26:36,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:36,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 14:26:36,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:36,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348194247] [2025-02-06 14:26:36,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348194247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:36,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:26:36,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:26:36,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269030379] [2025-02-06 14:26:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:36,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:26:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:36,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:26:36,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:26:36,385 INFO L87 Difference]: Start difference. First operand 359 states and 404 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:36,497 INFO L93 Difference]: Finished difference Result 359 states and 404 transitions. [2025-02-06 14:26:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:26:36,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2025-02-06 14:26:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:36,498 INFO L225 Difference]: With dead ends: 359 [2025-02-06 14:26:36,498 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 14:26:36,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 14:26:36,499 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:36,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 41 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:26:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 14:26:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-06 14:26:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 313 states have (on average 1.2236421725239617) internal successors, (383), 346 states have internal predecessors, (383), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:26:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 401 transitions. [2025-02-06 14:26:36,509 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 401 transitions. Word has length 122 [2025-02-06 14:26:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:36,509 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 401 transitions. [2025-02-06 14:26:36,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 401 transitions. [2025-02-06 14:26:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 14:26:36,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:36,510 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:36,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:26:36,510 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:36,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash 396016055, now seen corresponding path program 1 times [2025-02-06 14:26:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:36,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-02-06 14:26:36,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:36,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 14:26:36,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 14:26:36,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:36,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:36,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606070089] [2025-02-06 14:26:36,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:36,535 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-06 14:26:36,536 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-06 14:26:36,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 14:26:36,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 14:26:36,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:36,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:36,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 14:26:36,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:36,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-02-06 14:26:36,843 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606070089] [2025-02-06 14:26:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606070089] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:26:36,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:26:36,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-06 14:26:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937570924] [2025-02-06 14:26:36,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:36,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:26:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:36,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:26:36,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:26:36,844 INFO L87 Difference]: Start difference. First operand 358 states and 401 transitions. Second operand has 8 states, 7 states have (on average 30.285714285714285) internal successors, (212), 8 states have internal predecessors, (212), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:26:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:37,230 INFO L93 Difference]: Finished difference Result 419 states and 454 transitions. [2025-02-06 14:26:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:26:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.285714285714285) internal successors, (212), 8 states have internal predecessors, (212), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 124 [2025-02-06 14:26:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:37,232 INFO L225 Difference]: With dead ends: 419 [2025-02-06 14:26:37,232 INFO L226 Difference]: Without dead ends: 389 [2025-02-06 14:26:37,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:26:37,232 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 346 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:37,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 151 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 14:26:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-06 14:26:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 342. [2025-02-06 14:26:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 302 states have (on average 1.1655629139072847) internal successors, (352), 331 states have internal predecessors, (352), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 14:26:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 368 transitions. [2025-02-06 14:26:37,243 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 368 transitions. Word has length 124 [2025-02-06 14:26:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:37,243 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 368 transitions. [2025-02-06 14:26:37,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.285714285714285) internal successors, (212), 8 states have internal predecessors, (212), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:26:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 368 transitions. [2025-02-06 14:26:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 14:26:37,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:37,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-06 14:26:37,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 14:26:37,449 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,SelfDestructingSolverStorable17 [2025-02-06 14:26:37,449 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:37,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash 773652483, now seen corresponding path program 1 times [2025-02-06 14:26:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:37,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155331880] [2025-02-06 14:26:37,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:37,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 14:26:37,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 14:26:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450687434] [2025-02-06 14:26:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:37,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:37,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:37,474 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-06 14:26:37,474 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-06 14:26:37,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 14:26:37,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 14:26:37,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:37,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:37,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 14:26:37,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 14:26:37,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:38,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:38,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155331880] [2025-02-06 14:26:38,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:38,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450687434] [2025-02-06 14:26:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450687434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:38,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:26:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-02-06 14:26:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278595487] [2025-02-06 14:26:38,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:38,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:26:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:38,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:26:38,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:38,332 INFO L87 Difference]: Start difference. First operand 342 states and 368 transitions. Second operand has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:38,593 INFO L93 Difference]: Finished difference Result 380 states and 407 transitions. [2025-02-06 14:26:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:26:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 147 [2025-02-06 14:26:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:38,594 INFO L225 Difference]: With dead ends: 380 [2025-02-06 14:26:38,595 INFO L226 Difference]: Without dead ends: 379 [2025-02-06 14:26:38,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:38,595 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 22 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:38,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 343 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:26:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-02-06 14:26:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 378. [2025-02-06 14:26:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 337 states have (on average 1.1483679525222552) internal successors, (387), 366 states have internal predecessors, (387), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:26:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 405 transitions. [2025-02-06 14:26:38,606 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 405 transitions. Word has length 147 [2025-02-06 14:26:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:38,606 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 405 transitions. [2025-02-06 14:26:38,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 405 transitions. [2025-02-06 14:26:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 14:26:38,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:38,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-06 14:26:38,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 14:26:38,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:38,808 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1786576825, now seen corresponding path program 1 times [2025-02-06 14:26:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156381793] [2025-02-06 14:26:38,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:38,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 14:26:38,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 14:26:38,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:38,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339903538] [2025-02-06 14:26:38,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:38,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:38,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:38,829 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-06 14:26:38,832 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-06 14:26:38,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 14:26:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 14:26:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:38,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:38,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 14:26:38,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 14:26:39,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156381793] [2025-02-06 14:26:39,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339903538] [2025-02-06 14:26:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339903538] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:39,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:26:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-02-06 14:26:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063173577] [2025-02-06 14:26:39,779 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:39,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:26:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:39,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:26:39,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:39,780 INFO L87 Difference]: Start difference. First operand 378 states and 405 transitions. Second operand has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:39,990 INFO L93 Difference]: Finished difference Result 380 states and 406 transitions. [2025-02-06 14:26:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:26:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 148 [2025-02-06 14:26:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:39,991 INFO L225 Difference]: With dead ends: 380 [2025-02-06 14:26:39,991 INFO L226 Difference]: Without dead ends: 342 [2025-02-06 14:26:39,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:39,992 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 22 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:39,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 295 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:26:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-06 14:26:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-02-06 14:26:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 302 states have (on average 1.1622516556291391) internal successors, (351), 331 states have internal predecessors, (351), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 14:26:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 367 transitions. [2025-02-06 14:26:40,000 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 367 transitions. Word has length 148 [2025-02-06 14:26:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:40,000 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 367 transitions. [2025-02-06 14:26:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 367 transitions. [2025-02-06 14:26:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 14:26:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:40,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:40,007 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-06 14:26:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:40,202 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -5965525, now seen corresponding path program 1 times [2025-02-06 14:26:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929985694] [2025-02-06 14:26:40,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:40,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 14:26:40,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 14:26:40,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:40,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 61 proven. 79 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 14:26:40,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929985694] [2025-02-06 14:26:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929985694] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979324002] [2025-02-06 14:26:40,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:40,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:40,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:40,445 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-06 14:26:40,447 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-06 14:26:40,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 14:26:40,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 14:26:40,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:40,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:40,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:26:40,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 137 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 14:26:40,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 137 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 14:26:41,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979324002] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:26:41,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:26:41,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-02-06 14:26:41,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730163977] [2025-02-06 14:26:41,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:41,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 14:26:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 14:26:41,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:26:41,145 INFO L87 Difference]: Start difference. First operand 342 states and 367 transitions. Second operand has 16 states, 16 states have (on average 26.1875) internal successors, (419), 14 states have internal predecessors, (419), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:26:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:41,220 INFO L93 Difference]: Finished difference Result 360 states and 384 transitions. [2025-02-06 14:26:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:26:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 26.1875) internal successors, (419), 14 states have internal predecessors, (419), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 167 [2025-02-06 14:26:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:41,222 INFO L225 Difference]: With dead ends: 360 [2025-02-06 14:26:41,222 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 14:26:41,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-02-06 14:26:41,223 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 73 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:41,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 878 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:26:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 14:26:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-02-06 14:26:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 177 states have (on average 1.0056497175141244) internal successors, (178), 178 states have internal predecessors, (178), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:26:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 190 transitions. [2025-02-06 14:26:41,232 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 190 transitions. Word has length 167 [2025-02-06 14:26:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:41,232 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 190 transitions. [2025-02-06 14:26:41,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 26.1875) internal successors, (419), 14 states have internal predecessors, (419), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:26:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 190 transitions. [2025-02-06 14:26:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-06 14:26:41,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:41,234 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-02-06 14:26:41,240 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-06 14:26:41,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:41,437 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1957737224, now seen corresponding path program 2 times [2025-02-06 14:26:41,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:41,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165515056] [2025-02-06 14:26:41,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:26:41,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:41,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-02-06 14:26:41,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-02-06 14:26:41,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:26:41,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:41,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199253262] [2025-02-06 14:26:41,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:26:41,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:41,465 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-06 14:26:41,467 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-06 14:26:41,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-02-06 14:26:41,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 200 statements. [2025-02-06 14:26:41,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 14:26:41,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:41,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:26:41,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-06 14:26:42,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:26:42,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165515056] [2025-02-06 14:26:42,057 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199253262] [2025-02-06 14:26:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199253262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:42,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:26:42,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:26:42,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544765444] [2025-02-06 14:26:42,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:42,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:26:42,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:42,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:26:42,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:26:42,058 INFO L87 Difference]: Start difference. First operand 187 states and 190 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:26:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:42,135 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2025-02-06 14:26:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:26:42,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 200 [2025-02-06 14:26:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:42,138 INFO L225 Difference]: With dead ends: 187 [2025-02-06 14:26:42,138 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:26:42,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:26:42,139 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:42,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 46 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:26:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:26:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:26:42,140 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-06 14:26:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:26:42,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2025-02-06 14:26:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:42,140 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:26:42,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:26:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:26:42,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:26:42,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2025-02-06 14:26:42,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2025-02-06 14:26:42,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2025-02-06 14:26:42,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2025-02-06 14:26:42,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2025-02-06 14:26:42,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2025-02-06 14:26:42,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2025-02-06 14:26:42,143 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2025-02-06 14:26:42,144 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2025-02-06 14:26:42,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2025-02-06 14:26:42,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2025-02-06 14:26:42,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2025-02-06 14:26:42,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2025-02-06 14:26:42,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 14:26:42,354 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,SelfDestructingSolverStorable21 [2025-02-06 14:26:42,356 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:42,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:26:42,511 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:26:42,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:26:42 BoogieIcfgContainer [2025-02-06 14:26:42,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:26:42,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:26:42,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:26:42,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:26:42,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:45" (3/4) ... [2025-02-06 14:26:42,524 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:26:42,528 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 14:26:42,528 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 14:26:42,533 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 14:26:42,533 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:26:42,533 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:26:42,533 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:26:42,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:26:42,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:26:42,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:26:42,595 INFO L158 Benchmark]: Toolchain (without parser) took 58068.37ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 122.6MB in the beginning and 187.9MB in the end (delta: -65.3MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2025-02-06 14:26:42,596 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:26:42,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.51ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 111.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:26:42,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.95ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:26:42,596 INFO L158 Benchmark]: Boogie Preprocessor took 19.83ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:26:42,596 INFO L158 Benchmark]: IcfgBuilder took 446.75ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 79.0MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 14:26:42,596 INFO L158 Benchmark]: TraceAbstraction took 57345.36ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 78.5MB in the beginning and 196.2MB in the end (delta: -117.7MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2025-02-06 14:26:42,596 INFO L158 Benchmark]: Witness Printer took 72.70ms. Allocated memory is still 293.6MB. Free memory was 196.2MB in the beginning and 187.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:26:42,601 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.92ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.51ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 111.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.95ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.83ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 446.75ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 79.0MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 57345.36ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 78.5MB in the beginning and 196.2MB in the end (delta: -117.7MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Witness Printer took 72.70ms. Allocated memory is still 293.6MB. Free memory was 196.2MB in the beginning and 187.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - 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: 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: 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 192 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 46.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 2154 SdHoareTripleChecker+Valid, 46.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2130 mSDsluCounter, 5342 SdHoareTripleChecker+Invalid, 45.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3197 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4778 IncrementalHoareTripleChecker+Invalid, 5014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 2145 mSDtfsCounter, 4778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2477 GetRequests, 2381 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=19, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 149 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 3649 NumberOfCodeBlocks, 3498 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3143 ConstructedInterpolants, 0 QuantifiedInterpolants, 22035 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2063 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 970/1532 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 84 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((((((0 <= k) && (2 <= c)) && (k <= 2)) && (2 == y)) && (x <= 307445734561825860)) && (c <= 9223372036854775805)) && (16 <= x)) || (((((k <= 2) && (c == 1)) && (x == 1)) && (y == 1)) && (1 <= k))) || (((((0 <= k) && (c == 0)) && (k <= 2)) && (y == 0)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:26:42,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE