./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/sqrt1-ll_unwindbound5.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 74ee724e3f951f784979d99a99eb9387abbe4e82f01cf4b5e019c1ec7f3be827 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:28:51,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:28:51,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:28:51,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:28:51,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:28:51,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:28:51,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:28:51,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:28:51,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:28:51,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:28:51,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:28:51,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:28:51,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:28:51,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:28:51,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:28:51,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:28:51,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:28:51,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:28:51,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:28:51,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:28:51,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:28:51,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:28:51,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:28:51,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:28:51,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:28:51,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:28:51,764 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 -> 74ee724e3f951f784979d99a99eb9387abbe4e82f01cf4b5e019c1ec7f3be827 [2025-01-10 02:28:51,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:28:51,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:28:51,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:28:51,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:28:51,982 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:28:51,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2025-01-10 02:28:53,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1cf282f/0925d46acd774c698f1bbdcede2de509/FLAGdb663a5f1 [2025-01-10 02:28:53,392 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:28:53,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2025-01-10 02:28:53,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1cf282f/0925d46acd774c698f1bbdcede2de509/FLAGdb663a5f1 [2025-01-10 02:28:53,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1cf282f/0925d46acd774c698f1bbdcede2de509 [2025-01-10 02:28:53,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:28:53,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:28:53,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:28:53,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:28:53,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:28:53,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a899782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53, skipping insertion in model container [2025-01-10 02:28:53,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:28:53,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:28:53,571 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:28:53,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:28:53,595 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:28:53,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53 WrapperNode [2025-01-10 02:28:53,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:28:53,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:28:53,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:28:53,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:28:53,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,624 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-01-10 02:28:53,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:28:53,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:28:53,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:28:53,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:28:53,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,637 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-01-10 02:28:53,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:28:53,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:28:53,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:28:53,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:28:53,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (1/1) ... [2025-01-10 02:28:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:28:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:53,670 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-01-10 02:28:53,672 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-01-10 02:28:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:28:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:28:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:28:53,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:28:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:28:53,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:28:53,726 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:28:53,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:28:53,964 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-10 02:28:53,965 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:28:53,976 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:28:53,976 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:28:53,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:28:53 BoogieIcfgContainer [2025-01-10 02:28:53,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:28:53,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:28:53,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:28:53,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:28:53,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:28:53" (1/3) ... [2025-01-10 02:28:53,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff57b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:28:53, skipping insertion in model container [2025-01-10 02:28:53,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:28:53" (2/3) ... [2025-01-10 02:28:53,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff57b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:28:53, skipping insertion in model container [2025-01-10 02:28:53,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:28:53" (3/3) ... [2025-01-10 02:28:53,982 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound5.c [2025-01-10 02:28:53,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:28:53,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll_unwindbound5.c that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 52 error locations. [2025-01-10 02:28:54,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:28:54,032 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;@1998eaaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:28:54,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-10 02:28:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:28:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 02:28:54,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:54,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 02:28:54,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 928069, now seen corresponding path program 1 times [2025-01-10 02:28:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572067769] [2025-01-10 02:28:54,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:54,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 02:28:54,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 02:28:54,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:54,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:28:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572067769] [2025-01-10 02:28:54,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572067769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:54,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:54,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:28:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866683001] [2025-01-10 02:28:54,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:54,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:28:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:54,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:28:54,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:28:54,125 INFO L87 Difference]: Start difference. First operand has 125 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 117 states have internal predecessors, (121), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-01-10 02:28:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:54,140 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2025-01-10 02:28:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:28:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 02:28:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:54,145 INFO L225 Difference]: With dead ends: 243 [2025-01-10 02:28:54,146 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 02:28:54,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-10 02:28:54,149 INFO L435 NwaCegarLoop]: 126 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, 126 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-01-10 02:28:54,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:28:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 02:28:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-10 02:28:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 107 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:28:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2025-01-10 02:28:54,181 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 4 [2025-01-10 02:28:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:54,182 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2025-01-10 02:28:54,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-01-10 02:28:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2025-01-10 02:28:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 02:28:54,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:54,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 02:28:54,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:28:54,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 02:28:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812214838] [2025-01-10 02:28:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:54,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 02:28:54,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 02:28:54,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:28:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:54,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812214838] [2025-01-10 02:28:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812214838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:28:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744853711] [2025-01-10 02:28:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:54,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:28:54,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:54,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:28:54,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:28:54,251 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 02:28:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:54,293 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2025-01-10 02:28:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:28:54,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 02:28:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:54,294 INFO L225 Difference]: With dead ends: 114 [2025-01-10 02:28:54,295 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 02:28:54,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:28:54,296 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 223 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-01-10 02:28:54,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:28:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 02:28:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-10 02:28:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 60 states have (on average 1.8) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:28:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2025-01-10 02:28:54,308 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 4 [2025-01-10 02:28:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:54,308 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2025-01-10 02:28:54,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 02:28:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2025-01-10 02:28:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:28:54,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:54,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:28:54,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:28:54,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:54,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2025-01-10 02:28:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025049320] [2025-01-10 02:28:54,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:54,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:28:54,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:28:54,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:54,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:28:54,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:54,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025049320] [2025-01-10 02:28:54,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025049320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:54,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:28:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310434747] [2025-01-10 02:28:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:54,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:28:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:54,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:28:54,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:28:54,359 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 02:28:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:54,395 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2025-01-10 02:28:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:28:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 02:28:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:54,396 INFO L225 Difference]: With dead ends: 166 [2025-01-10 02:28:54,396 INFO L226 Difference]: Without dead ends: 117 [2025-01-10 02:28:54,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:28:54,397 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:54,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 338 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:28:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-10 02:28:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-10 02:28:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 64 states have (on average 1.75) internal successors, (112), 110 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:28:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2025-01-10 02:28:54,403 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 5 [2025-01-10 02:28:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:54,403 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2025-01-10 02:28:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 02:28:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2025-01-10 02:28:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:28:54,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:54,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:28:54,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:28:54,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:54,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1805858121, now seen corresponding path program 1 times [2025-01-10 02:28:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872604119] [2025-01-10 02:28:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:54,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:28:54,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:28:54,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:54,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:28:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872604119] [2025-01-10 02:28:54,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872604119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:54,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:54,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:28:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051493886] [2025-01-10 02:28:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:54,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:28:54,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:54,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:28:54,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:28:54,453 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:28:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:54,571 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2025-01-10 02:28:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:28:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 02:28:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:54,573 INFO L225 Difference]: With dead ends: 211 [2025-01-10 02:28:54,575 INFO L226 Difference]: Without dead ends: 191 [2025-01-10 02:28:54,575 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-01-10 02:28:54,575 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:54,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 171 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-10 02:28:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 156. [2025-01-10 02:28:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.606060606060606) internal successors, (159), 145 states have internal predecessors, (159), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:28:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2025-01-10 02:28:54,595 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 7 [2025-01-10 02:28:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2025-01-10 02:28:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:28:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2025-01-10 02:28:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:28:54,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:54,596 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] [2025-01-10 02:28:54,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:28:54,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:54,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1297131349, now seen corresponding path program 1 times [2025-01-10 02:28:54,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:54,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420737499] [2025-01-10 02:28:54,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:54,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:28:54,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:28:54,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:54,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:28:54,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642358581] [2025-01-10 02:28:54,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:54,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:54,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:54,647 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-01-10 02:28:54,649 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-01-10 02:28:54,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:28:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:28:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:54,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:28:54,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:28:54,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:28:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420737499] [2025-01-10 02:28:54,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:28:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642358581] [2025-01-10 02:28:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642358581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:54,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:28:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998765216] [2025-01-10 02:28:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:28:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:54,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:28:54,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:28:54,727 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-01-10 02:28:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:54,808 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2025-01-10 02:28:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:28:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2025-01-10 02:28:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:54,811 INFO L225 Difference]: With dead ends: 183 [2025-01-10 02:28:54,811 INFO L226 Difference]: Without dead ends: 175 [2025-01-10 02:28:54,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-01-10 02:28:54,813 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:54,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-10 02:28:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2025-01-10 02:28:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.5596330275229358) internal successors, (170), 155 states have internal predecessors, (170), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:28:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2025-01-10 02:28:54,831 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 28 [2025-01-10 02:28:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:54,831 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2025-01-10 02:28:54,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-01-10 02:28:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2025-01-10 02:28:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:28:54,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:54,832 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] [2025-01-10 02:28:54,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:28:55,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:55,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:55,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:55,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1556366081, now seen corresponding path program 1 times [2025-01-10 02:28:55,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:55,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081535461] [2025-01-10 02:28:55,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:55,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:28:55,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:28:55,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:55,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:28:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081535461] [2025-01-10 02:28:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081535461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:28:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364571868] [2025-01-10 02:28:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:28:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:55,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:28:55,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:28:55,119 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-01-10 02:28:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:55,198 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2025-01-10 02:28:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:28:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2025-01-10 02:28:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:55,200 INFO L225 Difference]: With dead ends: 183 [2025-01-10 02:28:55,200 INFO L226 Difference]: Without dead ends: 173 [2025-01-10 02:28:55,200 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-01-10 02:28:55,201 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:55,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 195 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-10 02:28:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-01-10 02:28:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.4821428571428572) internal successors, (166), 158 states have internal predecessors, (166), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:28:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2025-01-10 02:28:55,207 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 29 [2025-01-10 02:28:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:55,207 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2025-01-10 02:28:55,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-01-10 02:28:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2025-01-10 02:28:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 02:28:55,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:55,208 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] [2025-01-10 02:28:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:28:55,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1529883217, now seen corresponding path program 1 times [2025-01-10 02:28:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612701093] [2025-01-10 02:28:55,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:55,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:28:55,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:28:55,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:55,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:28:55,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612701093] [2025-01-10 02:28:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612701093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:28:55,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562355699] [2025-01-10 02:28:55,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:28:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:55,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:28:55,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:28:55,283 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 02:28:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:55,410 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2025-01-10 02:28:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:28:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 32 [2025-01-10 02:28:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:55,411 INFO L225 Difference]: With dead ends: 175 [2025-01-10 02:28:55,411 INFO L226 Difference]: Without dead ends: 173 [2025-01-10 02:28:55,411 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-01-10 02:28:55,412 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:55,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 239 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-10 02:28:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-01-10 02:28:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 158 states have internal predecessors, (164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:28:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2025-01-10 02:28:55,427 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 32 [2025-01-10 02:28:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:55,427 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2025-01-10 02:28:55,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-01-10 02:28:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2025-01-10 02:28:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:28:55,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:55,428 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] [2025-01-10 02:28:55,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:28:55,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:55,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1755706035, now seen corresponding path program 1 times [2025-01-10 02:28:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30718822] [2025-01-10 02:28:55,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:28:55,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:28:55,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:55,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:28:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30718822] [2025-01-10 02:28:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30718822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:28:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5915711] [2025-01-10 02:28:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:55,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:28:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:55,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:28:55,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:28:55,525 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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-01-10 02:28:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:55,609 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2025-01-10 02:28:55,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:28:55,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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 36 [2025-01-10 02:28:55,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:55,610 INFO L225 Difference]: With dead ends: 175 [2025-01-10 02:28:55,610 INFO L226 Difference]: Without dead ends: 147 [2025-01-10 02:28:55,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 02:28:55,611 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 29 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:55,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 162 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-10 02:28:55,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-01-10 02:28:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.5274725274725274) internal successors, (139), 137 states have internal predecessors, (139), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:28:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2025-01-10 02:28:55,621 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 36 [2025-01-10 02:28:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:55,622 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2025-01-10 02:28:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (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-01-10 02:28:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2025-01-10 02:28:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:28:55,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:55,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:28:55,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:28:55,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:55,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -217857003, now seen corresponding path program 1 times [2025-01-10 02:28:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:55,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824846535] [2025-01-10 02:28:55,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:55,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:28:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:28:55,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:55,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:55,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:55,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824846535] [2025-01-10 02:28:55,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824846535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:55,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:28:55,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632332429] [2025-01-10 02:28:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:55,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:28:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:55,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:28:55,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:28:55,737 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:55,833 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2025-01-10 02:28:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:28:55,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-10 02:28:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:55,834 INFO L225 Difference]: With dead ends: 150 [2025-01-10 02:28:55,835 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 02:28:55,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:28:55,835 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:55,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 221 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 02:28:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2025-01-10 02:28:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 138 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:28:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2025-01-10 02:28:55,843 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 49 [2025-01-10 02:28:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:55,845 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2025-01-10 02:28:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2025-01-10 02:28:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:28:55,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:55,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:28:55,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:28:55,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:55,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1836367609, now seen corresponding path program 1 times [2025-01-10 02:28:55,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:55,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110785385] [2025-01-10 02:28:55,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:55,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:28:55,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:28:55,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:55,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110785385] [2025-01-10 02:28:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110785385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:28:55,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:28:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848608696] [2025-01-10 02:28:55,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:55,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:28:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:55,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:28:55,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:28:55,935 INFO L87 Difference]: Start difference. First operand 148 states and 156 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:56,029 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2025-01-10 02:28:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:28:56,030 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-01-10 02:28:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:56,031 INFO L225 Difference]: With dead ends: 150 [2025-01-10 02:28:56,034 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 02:28:56,035 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-01-10 02:28:56,035 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:56,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 02:28:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-10 02:28:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 139 states have internal predecessors, (141), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:28:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2025-01-10 02:28:56,044 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 50 [2025-01-10 02:28:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:56,044 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2025-01-10 02:28:56,044 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2025-01-10 02:28:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 02:28:56,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:56,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:28:56,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:28:56,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:56,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2065940915, now seen corresponding path program 1 times [2025-01-10 02:28:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813033612] [2025-01-10 02:28:56,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:56,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 02:28:56,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 02:28:56,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:56,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813033612] [2025-01-10 02:28:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813033612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:28:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596594552] [2025-01-10 02:28:56,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:56,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:56,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:56,137 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-01-10 02:28:56,141 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-01-10 02:28:56,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 02:28:56,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 02:28:56,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:56,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:56,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:28:56,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:56,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:28:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596594552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:56,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:28:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:28:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007597894] [2025-01-10 02:28:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:56,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:28:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:56,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:28:56,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:28:56,270 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:56,323 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2025-01-10 02:28:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:28:56,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-01-10 02:28:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:56,328 INFO L225 Difference]: With dead ends: 197 [2025-01-10 02:28:56,328 INFO L226 Difference]: Without dead ends: 196 [2025-01-10 02:28:56,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:28:56,329 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 77 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:56,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 506 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:28:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-10 02:28:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 164. [2025-01-10 02:28:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.528301886792453) internal successors, (162), 152 states have internal predecessors, (162), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:28:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 182 transitions. [2025-01-10 02:28:56,336 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 182 transitions. Word has length 53 [2025-01-10 02:28:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:56,336 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 182 transitions. [2025-01-10 02:28:56,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 182 transitions. [2025-01-10 02:28:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 02:28:56,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:56,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-01-10 02:28:56,343 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-01-10 02:28:56,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:56,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:56,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1094327182, now seen corresponding path program 1 times [2025-01-10 02:28:56,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:56,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464388534] [2025-01-10 02:28:56,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:56,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 02:28:56,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 02:28:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:56,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464388534] [2025-01-10 02:28:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464388534] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:28:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336303416] [2025-01-10 02:28:56,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:56,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:56,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:56,600 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-01-10 02:28:56,603 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-01-10 02:28:56,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 02:28:56,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 02:28:56,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:56,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:56,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:28:56,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:56,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:28:56,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336303416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:28:56,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:28:56,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:28:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770870637] [2025-01-10 02:28:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:28:56,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:28:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:56,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:28:56,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:28:56,688 INFO L87 Difference]: Start difference. First operand 164 states and 182 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:56,755 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2025-01-10 02:28:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:28:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-01-10 02:28:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:56,757 INFO L225 Difference]: With dead ends: 164 [2025-01-10 02:28:56,757 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 02:28:56,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-01-10 02:28:56,758 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:56,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 139 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 02:28:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-01-10 02:28:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.4056603773584906) internal successors, (149), 143 states have internal predecessors, (149), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:28:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2025-01-10 02:28:56,764 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 55 [2025-01-10 02:28:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2025-01-10 02:28:56,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:28:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2025-01-10 02:28:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:28:56,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:56,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:28:56,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:28:56,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:56,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:56,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash 435595776, now seen corresponding path program 1 times [2025-01-10 02:28:56,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:56,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296941136] [2025-01-10 02:28:56,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:56,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:56,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:28:56,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:28:56,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:56,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296941136] [2025-01-10 02:28:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296941136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:28:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66159795] [2025-01-10 02:28:57,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:57,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:57,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:57,044 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-01-10 02:28:57,051 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-01-10 02:28:57,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:28:57,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:28:57,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:57,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:57,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:28:57,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:57,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:28:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66159795] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:28:57,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:28:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:28:57,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395740461] [2025-01-10 02:28:57,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:57,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:28:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:57,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:28:57,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:28:57,242 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:28:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:57,361 INFO L93 Difference]: Finished difference Result 279 states and 330 transitions. [2025-01-10 02:28:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:28:57,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2025-01-10 02:28:57,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:57,363 INFO L225 Difference]: With dead ends: 279 [2025-01-10 02:28:57,363 INFO L226 Difference]: Without dead ends: 270 [2025-01-10 02:28:57,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 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-01-10 02:28:57,364 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 188 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:57,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 222 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-10 02:28:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 146. [2025-01-10 02:28:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 134 states have internal predecessors, (136), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:28:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2025-01-10 02:28:57,373 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 56 [2025-01-10 02:28:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:57,374 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2025-01-10 02:28:57,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.0) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:28:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2025-01-10 02:28:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:28:57,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:57,375 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-01-10 02:28:57,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:28:57,575 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,SelfDestructingSolverStorable12 [2025-01-10 02:28:57,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:57,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1665212224, now seen corresponding path program 1 times [2025-01-10 02:28:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:57,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858489994] [2025-01-10 02:28:57,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:57,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:28:57,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:28:57,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:57,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:28:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673110981] [2025-01-10 02:28:57,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:57,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:57,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:57,598 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-01-10 02:28:57,603 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-01-10 02:28:57,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:28:57,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:28:57,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:57,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:57,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:28:57,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:28:57,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:28:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858489994] [2025-01-10 02:28:57,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:28:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673110981] [2025-01-10 02:28:57,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673110981] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:28:57,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:28:57,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 02:28:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355214940] [2025-01-10 02:28:57,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:57,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:28:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:57,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:28:57,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:28:57,802 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:28:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:57,948 INFO L93 Difference]: Finished difference Result 370 states and 405 transitions. [2025-01-10 02:28:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:28:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2025-01-10 02:28:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:57,950 INFO L225 Difference]: With dead ends: 370 [2025-01-10 02:28:57,950 INFO L226 Difference]: Without dead ends: 368 [2025-01-10 02:28:57,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:28:57,950 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 241 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:57,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 343 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-10 02:28:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 244. [2025-01-10 02:28:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 196 states have (on average 1.3265306122448979) internal successors, (260), 224 states have internal predecessors, (260), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 02:28:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 296 transitions. [2025-01-10 02:28:57,960 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 296 transitions. Word has length 69 [2025-01-10 02:28:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:57,960 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 296 transitions. [2025-01-10 02:28:57,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:28:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 296 transitions. [2025-01-10 02:28:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 02:28:57,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:57,961 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-01-10 02:28:57,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:28:58,166 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,SelfDestructingSolverStorable13 [2025-01-10 02:28:58,166 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:58,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash -20255454, now seen corresponding path program 1 times [2025-01-10 02:28:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:58,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518804871] [2025-01-10 02:28:58,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:58,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 02:28:58,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 02:28:58,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:58,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:28:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621535929] [2025-01-10 02:28:58,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:58,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:58,179 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-01-10 02:28:58,180 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-01-10 02:28:58,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 02:28:58,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 02:28:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:58,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:28:58,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:58,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518804871] [2025-01-10 02:28:58,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:28:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621535929] [2025-01-10 02:28:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621535929] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:28:58,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:28:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 02:28:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237311578] [2025-01-10 02:28:58,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:58,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:28:58,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:58,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:28:58,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:28:58,380 INFO L87 Difference]: Start difference. First operand 244 states and 296 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-10 02:28:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:58,550 INFO L93 Difference]: Finished difference Result 332 states and 406 transitions. [2025-01-10 02:28:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:28:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 76 [2025-01-10 02:28:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:58,552 INFO L225 Difference]: With dead ends: 332 [2025-01-10 02:28:58,553 INFO L226 Difference]: Without dead ends: 324 [2025-01-10 02:28:58,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:28:58,553 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 224 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:58,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 249 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-10 02:28:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 244. [2025-01-10 02:28:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 200 states have (on average 1.24) internal successors, (248), 222 states have internal predecessors, (248), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 02:28:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 288 transitions. [2025-01-10 02:28:58,565 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 288 transitions. Word has length 76 [2025-01-10 02:28:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:58,565 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 288 transitions. [2025-01-10 02:28:58,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-10 02:28:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 288 transitions. [2025-01-10 02:28:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 02:28:58,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:58,566 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-01-10 02:28:58,572 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-01-10 02:28:58,771 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,SelfDestructingSolverStorable14 [2025-01-10 02:28:58,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:58,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -627919000, now seen corresponding path program 1 times [2025-01-10 02:28:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4023872] [2025-01-10 02:28:58,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:58,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 02:28:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 02:28:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4023872] [2025-01-10 02:28:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4023872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:28:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5802285] [2025-01-10 02:28:58,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:58,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:58,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:58,866 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-01-10 02:28:58,870 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-01-10 02:28:58,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 02:28:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 02:28:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:58,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:28:58,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:59,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:59,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5802285] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:28:59,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:28:59,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:28:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320859220] [2025-01-10 02:28:59,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:59,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:28:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:59,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:28:59,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:28:59,197 INFO L87 Difference]: Start difference. First operand 244 states and 288 transitions. Second operand has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:28:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:28:59,365 INFO L93 Difference]: Finished difference Result 244 states and 288 transitions. [2025-01-10 02:28:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:28:59,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 77 [2025-01-10 02:28:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:28:59,367 INFO L225 Difference]: With dead ends: 244 [2025-01-10 02:28:59,367 INFO L226 Difference]: Without dead ends: 241 [2025-01-10 02:28:59,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:28:59,368 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 148 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:28:59,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 232 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:28:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-10 02:28:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-01-10 02:28:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 200 states have (on average 1.205) internal successors, (241), 219 states have internal predecessors, (241), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 02:28:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 281 transitions. [2025-01-10 02:28:59,380 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 281 transitions. Word has length 77 [2025-01-10 02:28:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:28:59,381 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 281 transitions. [2025-01-10 02:28:59,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.555555555555555) internal successors, (140), 10 states have internal predecessors, (140), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:28:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2025-01-10 02:28:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-10 02:28:59,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:28:59,382 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-01-10 02:28:59,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:28:59,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:59,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:28:59,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:28:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2009347556, now seen corresponding path program 1 times [2025-01-10 02:28:59,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:28:59,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918139076] [2025-01-10 02:28:59,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:28:59,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 02:28:59,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 02:28:59,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:59,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:28:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918139076] [2025-01-10 02:28:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918139076] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:28:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602014701] [2025-01-10 02:28:59,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:28:59,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:28:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:28:59,690 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-01-10 02:28:59,697 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-01-10 02:28:59,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 02:28:59,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 02:28:59,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:28:59,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:28:59,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:28:59,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:28:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:59,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:28:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:28:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602014701] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:28:59,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:28:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:28:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943042915] [2025-01-10 02:28:59,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:28:59,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:28:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:28:59,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:28:59,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:28:59,934 INFO L87 Difference]: Start difference. First operand 241 states and 281 transitions. Second operand has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:00,114 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2025-01-10 02:29:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:29:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 78 [2025-01-10 02:29:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:00,115 INFO L225 Difference]: With dead ends: 296 [2025-01-10 02:29:00,116 INFO L226 Difference]: Without dead ends: 287 [2025-01-10 02:29:00,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:00,116 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 99 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:00,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 274 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-10 02:29:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 251. [2025-01-10 02:29:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 214 states have (on average 1.1214953271028036) internal successors, (240), 227 states have internal predecessors, (240), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 02:29:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 284 transitions. [2025-01-10 02:29:00,127 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 284 transitions. Word has length 78 [2025-01-10 02:29:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:00,127 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 284 transitions. [2025-01-10 02:29:00,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.777777777777779) internal successors, (142), 10 states have internal predecessors, (142), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 284 transitions. [2025-01-10 02:29:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 02:29:00,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:00,128 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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-01-10 02:29:00,137 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-01-10 02:29:00,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:29:00,329 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:00,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:00,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1752279386, now seen corresponding path program 1 times [2025-01-10 02:29:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:00,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757218781] [2025-01-10 02:29:00,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:00,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 02:29:00,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 02:29:00,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:00,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757218781] [2025-01-10 02:29:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757218781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656818842] [2025-01-10 02:29:00,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:00,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:00,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:00,450 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-01-10 02:29:00,454 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-01-10 02:29:00,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-10 02:29:00,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 02:29:00,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:00,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:00,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:00,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:00,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656818842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 02:29:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951370466] [2025-01-10 02:29:00,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:29:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:29:00,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:00,669 INFO L87 Difference]: Start difference. First operand 251 states and 284 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-01-10 02:29:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:00,772 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2025-01-10 02:29:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:00,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 80 [2025-01-10 02:29:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:00,773 INFO L225 Difference]: With dead ends: 253 [2025-01-10 02:29:00,773 INFO L226 Difference]: Without dead ends: 209 [2025-01-10 02:29:00,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:00,774 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 46 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:00,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 197 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-10 02:29:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-01-10 02:29:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.0494505494505495) internal successors, (191), 188 states have internal predecessors, (191), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 02:29:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 227 transitions. [2025-01-10 02:29:00,783 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 227 transitions. Word has length 80 [2025-01-10 02:29:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 227 transitions. [2025-01-10 02:29:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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-01-10 02:29:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 227 transitions. [2025-01-10 02:29:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-10 02:29:00,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:00,784 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1] [2025-01-10 02:29:00,790 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-01-10 02:29:00,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:29:00,985 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:00,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash 499414887, now seen corresponding path program 1 times [2025-01-10 02:29:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:00,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965016702] [2025-01-10 02:29:00,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:00,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-10 02:29:00,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-10 02:29:00,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:00,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965016702] [2025-01-10 02:29:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965016702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691633893] [2025-01-10 02:29:01,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:01,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:01,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:01,126 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-01-10 02:29:01,127 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-01-10 02:29:01,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-10 02:29:01,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-10 02:29:01,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:01,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:01,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:29:01,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:01,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691633893] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:01,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:01,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 02:29:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759226934] [2025-01-10 02:29:01,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:01,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 02:29:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:01,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 02:29:01,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:29:01,664 INFO L87 Difference]: Start difference. First operand 209 states and 227 transitions. Second operand has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-10 02:29:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:01,971 INFO L93 Difference]: Finished difference Result 338 states and 378 transitions. [2025-01-10 02:29:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:29:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 146 [2025-01-10 02:29:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:01,973 INFO L225 Difference]: With dead ends: 338 [2025-01-10 02:29:01,973 INFO L226 Difference]: Without dead ends: 337 [2025-01-10 02:29:01,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:29:01,975 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 183 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:01,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 400 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-10 02:29:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 299. [2025-01-10 02:29:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 265 states have (on average 1.0641509433962264) internal successors, (282), 271 states have internal predecessors, (282), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 02:29:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 332 transitions. [2025-01-10 02:29:01,989 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 332 transitions. Word has length 146 [2025-01-10 02:29:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:01,989 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 332 transitions. [2025-01-10 02:29:01,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 16.0) internal successors, (304), 20 states have internal predecessors, (304), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-10 02:29:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 332 transitions. [2025-01-10 02:29:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-10 02:29:01,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:01,990 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-01-10 02:29:01,997 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-01-10 02:29:02,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:02,191 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:02,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash -668721838, now seen corresponding path program 2 times [2025-01-10 02:29:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423580721] [2025-01-10 02:29:02,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:02,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-01-10 02:29:02,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-01-10 02:29:02,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:02,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423580721] [2025-01-10 02:29:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423580721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335747734] [2025-01-10 02:29:02,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:02,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:02,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:02,364 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-01-10 02:29:02,368 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-01-10 02:29:02,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-01-10 02:29:02,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-01-10 02:29:02,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:02,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:02,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:29:02,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:02,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:02,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335747734] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:02,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 02:29:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925649322] [2025-01-10 02:29:02,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:02,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:29:02,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:02,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:29:02,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:02,950 INFO L87 Difference]: Start difference. First operand 299 states and 332 transitions. Second operand has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-10 02:29:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:03,351 INFO L93 Difference]: Finished difference Result 379 states and 420 transitions. [2025-01-10 02:29:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:29:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 174 [2025-01-10 02:29:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:03,353 INFO L225 Difference]: With dead ends: 379 [2025-01-10 02:29:03,353 INFO L226 Difference]: Without dead ends: 355 [2025-01-10 02:29:03,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2025-01-10 02:29:03,354 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 299 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:03,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 466 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:29:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-10 02:29:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 319. [2025-01-10 02:29:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 283 states have (on average 1.0600706713780919) internal successors, (300), 289 states have internal predecessors, (300), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-10 02:29:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 354 transitions. [2025-01-10 02:29:03,376 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 354 transitions. Word has length 174 [2025-01-10 02:29:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:03,376 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 354 transitions. [2025-01-10 02:29:03,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 16.19047619047619) internal successors, (340), 22 states have internal predecessors, (340), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-10 02:29:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 354 transitions. [2025-01-10 02:29:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-10 02:29:03,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:03,379 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-01-10 02:29:03,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:03,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:03,580 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:03,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1707117189, now seen corresponding path program 2 times [2025-01-10 02:29:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273584349] [2025-01-10 02:29:03,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:03,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-01-10 02:29:03,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-01-10 02:29:03,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:03,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672192869] [2025-01-10 02:29:03,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:03,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:03,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:03,622 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-01-10 02:29:03,624 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-01-10 02:29:03,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-01-10 02:29:03,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-01-10 02:29:03,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:03,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:03,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:29:03,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-10 02:29:03,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-10 02:29:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273584349] [2025-01-10 02:29:04,156 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672192869] [2025-01-10 02:29:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672192869] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:04,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:04,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 02:29:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159918131] [2025-01-10 02:29:04,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:29:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:04,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:29:04,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:04,157 INFO L87 Difference]: Start difference. First operand 319 states and 354 transitions. Second operand has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-10 02:29:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:04,609 INFO L93 Difference]: Finished difference Result 512 states and 565 transitions. [2025-01-10 02:29:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 213 [2025-01-10 02:29:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:04,611 INFO L225 Difference]: With dead ends: 512 [2025-01-10 02:29:04,611 INFO L226 Difference]: Without dead ends: 510 [2025-01-10 02:29:04,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:29:04,612 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 433 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:04,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 843 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:29:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-01-10 02:29:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 433. [2025-01-10 02:29:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 388 states have (on average 1.059278350515464) internal successors, (411), 394 states have internal predecessors, (411), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:29:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 483 transitions. [2025-01-10 02:29:04,626 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 483 transitions. Word has length 213 [2025-01-10 02:29:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:04,626 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 483 transitions. [2025-01-10 02:29:04,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.09090909090909) internal successors, (298), 12 states have internal predecessors, (298), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-10 02:29:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 483 transitions. [2025-01-10 02:29:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-10 02:29:04,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:04,628 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-01-10 02:29:04,634 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-01-10 02:29:04,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:04,829 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:04,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash 604319367, now seen corresponding path program 2 times [2025-01-10 02:29:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:04,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277495893] [2025-01-10 02:29:04,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:04,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-01-10 02:29:04,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 220 of 220 statements. [2025-01-10 02:29:04,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:04,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241924530] [2025-01-10 02:29:04,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:04,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:04,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:04,858 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-01-10 02:29:04,860 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-01-10 02:29:04,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-01-10 02:29:04,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 220 of 220 statements. [2025-01-10 02:29:04,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:04,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:04,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:29:04,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-10 02:29:05,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-10 02:29:05,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:05,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277495893] [2025-01-10 02:29:05,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:05,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241924530] [2025-01-10 02:29:05,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241924530] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:05,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 02:29:05,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836904025] [2025-01-10 02:29:05,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:05,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:29:05,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:05,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:29:05,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:05,371 INFO L87 Difference]: Start difference. First operand 433 states and 483 transitions. Second operand has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-01-10 02:29:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:05,783 INFO L93 Difference]: Finished difference Result 505 states and 563 transitions. [2025-01-10 02:29:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:05,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 220 [2025-01-10 02:29:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:05,785 INFO L225 Difference]: With dead ends: 505 [2025-01-10 02:29:05,785 INFO L226 Difference]: Without dead ends: 461 [2025-01-10 02:29:05,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:29:05,786 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 332 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:05,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 895 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:29:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-01-10 02:29:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2025-01-10 02:29:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 380 states have (on average 1.0394736842105263) internal successors, (395), 386 states have internal predecessors, (395), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:29:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 467 transitions. [2025-01-10 02:29:05,801 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 467 transitions. Word has length 220 [2025-01-10 02:29:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:05,801 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 467 transitions. [2025-01-10 02:29:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 27.454545454545453) internal successors, (302), 12 states have internal predecessors, (302), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-01-10 02:29:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 467 transitions. [2025-01-10 02:29:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-10 02:29:05,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:05,804 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-01-10 02:29:05,810 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-01-10 02:29:06,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:06,008 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:06,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash 109899843, now seen corresponding path program 2 times [2025-01-10 02:29:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849980828] [2025-01-10 02:29:06,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:06,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-01-10 02:29:06,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 338 of 338 statements. [2025-01-10 02:29:06,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:06,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-01-10 02:29:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849980828] [2025-01-10 02:29:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849980828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124568970] [2025-01-10 02:29:06,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:06,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:06,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:06,195 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-01-10 02:29:06,197 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-01-10 02:29:06,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-01-10 02:29:06,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 338 of 338 statements. [2025-01-10 02:29:06,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:06,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:06,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:06,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-01-10 02:29:06,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2025-01-10 02:29:06,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124568970] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:06,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:06,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 02:29:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612163067] [2025-01-10 02:29:06,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:06,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:29:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:06,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:29:06,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:29:06,826 INFO L87 Difference]: Start difference. First operand 425 states and 467 transitions. Second operand has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-10 02:29:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:06,938 INFO L93 Difference]: Finished difference Result 425 states and 467 transitions. [2025-01-10 02:29:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:29:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 338 [2025-01-10 02:29:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:06,941 INFO L225 Difference]: With dead ends: 425 [2025-01-10 02:29:06,941 INFO L226 Difference]: Without dead ends: 424 [2025-01-10 02:29:06,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:29:06,941 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 249 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:06,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 173 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-10 02:29:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-01-10 02:29:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 380 states have (on average 1.0289473684210526) internal successors, (391), 385 states have internal predecessors, (391), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:29:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 463 transitions. [2025-01-10 02:29:06,960 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 463 transitions. Word has length 338 [2025-01-10 02:29:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:06,961 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 463 transitions. [2025-01-10 02:29:06,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-10 02:29:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 463 transitions. [2025-01-10 02:29:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-10 02:29:06,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:06,967 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1] [2025-01-10 02:29:06,977 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-01-10 02:29:07,168 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,SelfDestructingSolverStorable22 [2025-01-10 02:29:07,168 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash 951120942, now seen corresponding path program 3 times [2025-01-10 02:29:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999533322] [2025-01-10 02:29:07,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:07,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 366 statements into 10 equivalence classes. [2025-01-10 02:29:07,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 135 of 366 statements. [2025-01-10 02:29:07,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 02:29:07,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 51 proven. 466 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2025-01-10 02:29:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999533322] [2025-01-10 02:29:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999533322] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256271512] [2025-01-10 02:29:07,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:07,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:07,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:07,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:29:07,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 02:29:07,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 366 statements into 10 equivalence classes. [2025-01-10 02:29:07,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 366 statements. [2025-01-10 02:29:07,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 02:29:07,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:07,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:29:07,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 126 proven. 176 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2025-01-10 02:29:07,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:08,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256271512] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:08,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:08,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-01-10 02:29:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899635502] [2025-01-10 02:29:08,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:08,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:29:08,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:08,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:29:08,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:08,197 INFO L87 Difference]: Start difference. First operand 424 states and 463 transitions. Second operand has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-10 02:29:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:08,656 INFO L93 Difference]: Finished difference Result 424 states and 463 transitions. [2025-01-10 02:29:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:29:08,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 366 [2025-01-10 02:29:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:08,658 INFO L225 Difference]: With dead ends: 424 [2025-01-10 02:29:08,658 INFO L226 Difference]: Without dead ends: 406 [2025-01-10 02:29:08,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:29:08,658 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 388 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:08,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 157 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:29:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-10 02:29:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-01-10 02:29:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 366 states have (on average 1.010928961748634) internal successors, (370), 369 states have internal predecessors, (370), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 02:29:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 438 transitions. [2025-01-10 02:29:08,688 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 438 transitions. Word has length 366 [2025-01-10 02:29:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:08,689 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 438 transitions. [2025-01-10 02:29:08,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 9.066666666666666) internal successors, (136), 16 states have internal predecessors, (136), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-01-10 02:29:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 438 transitions. [2025-01-10 02:29:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-01-10 02:29:08,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:08,695 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-01-10 02:29:08,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:08,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 02:29:08,896 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:08,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash -694513679, now seen corresponding path program 3 times [2025-01-10 02:29:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850698045] [2025-01-10 02:29:08,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:08,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:08,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 501 statements into 15 equivalence classes. [2025-01-10 02:29:09,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 473 of 501 statements. [2025-01-10 02:29:09,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-10 02:29:09,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1745 proven. 25 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-10 02:29:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:10,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850698045] [2025-01-10 02:29:10,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850698045] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:10,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225462463] [2025-01-10 02:29:10,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:10,126 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:29:10,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 02:29:10,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 501 statements into 15 equivalence classes. [2025-01-10 02:29:10,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 78 of 501 statements. [2025-01-10 02:29:10,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 02:29:10,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:10,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:29:10,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-01-10 02:29:10,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:10,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225462463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:10,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:10,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [30] total 36 [2025-01-10 02:29:10,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515250929] [2025-01-10 02:29:10,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:10,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:29:10,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:10,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:29:10,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 02:29:10,416 INFO L87 Difference]: Start difference. First operand 406 states and 438 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:29:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:10,762 INFO L93 Difference]: Finished difference Result 408 states and 440 transitions. [2025-01-10 02:29:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:29:10,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 501 [2025-01-10 02:29:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:10,767 INFO L225 Difference]: With dead ends: 408 [2025-01-10 02:29:10,768 INFO L226 Difference]: Without dead ends: 406 [2025-01-10 02:29:10,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 02:29:10,769 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 113 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:10,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 87 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:29:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-10 02:29:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2025-01-10 02:29:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 366 states have (on average 1.005464480874317) internal successors, (368), 367 states have internal predecessors, (368), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 02:29:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 436 transitions. [2025-01-10 02:29:10,809 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 436 transitions. Word has length 501 [2025-01-10 02:29:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:10,809 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 436 transitions. [2025-01-10 02:29:10,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:29:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 436 transitions. [2025-01-10 02:29:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-01-10 02:29:10,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:10,813 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-01-10 02:29:10,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:11,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:11,014 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-01-10 02:29:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash 463700817, now seen corresponding path program 3 times [2025-01-10 02:29:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836710686] [2025-01-10 02:29:11,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:11,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 508 statements into 15 equivalence classes. [2025-01-10 02:29:11,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 480 of 508 statements. [2025-01-10 02:29:11,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-01-10 02:29:11,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1775 proven. 25 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-10 02:29:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836710686] [2025-01-10 02:29:12,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836710686] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307142457] [2025-01-10 02:29:12,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:12,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:12,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:12,170 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:29:12,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 02:29:12,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 508 statements into 15 equivalence classes. [2025-01-10 02:29:12,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 48 of 508 statements. [2025-01-10 02:29:12,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 02:29:12,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:12,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:29:12,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 180 proven. 234 refuted. 0 times theorem prover too weak. 3370 trivial. 0 not checked. [2025-01-10 02:29:12,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:14,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307142457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:14,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:14,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 8] total 37 [2025-01-10 02:29:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548095279] [2025-01-10 02:29:14,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:14,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-10 02:29:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:14,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-10 02:29:14,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2025-01-10 02:29:14,972 INFO L87 Difference]: Start difference. First operand 404 states and 436 transitions. Second operand has 37 states, 37 states have (on average 11.135135135135135) internal successors, (412), 37 states have internal predecessors, (412), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) [2025-01-10 02:29:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:17,025 INFO L93 Difference]: Finished difference Result 426 states and 453 transitions. [2025-01-10 02:29:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-10 02:29:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 11.135135135135135) internal successors, (412), 37 states have internal predecessors, (412), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) Word has length 508 [2025-01-10 02:29:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:17,029 INFO L225 Difference]: With dead ends: 426 [2025-01-10 02:29:17,029 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:29:17,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2912 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1258, Invalid=7672, Unknown=0, NotChecked=0, Total=8930 [2025-01-10 02:29:17,032 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 163 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:17,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 375 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:29:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:29:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:29:17,032 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-01-10 02:29:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:29:17,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 508 [2025-01-10 02:29:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:17,033 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:29:17,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 11.135135135135135) internal successors, (412), 37 states have internal predecessors, (412), 14 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 14 states have call predecessors, (37), 14 states have call successors, (37) [2025-01-10 02:29:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:29:17,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-01-10 02:29:17,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-01-10 02:29:17,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-01-10 02:29:17,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-01-10 02:29:17,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-01-10 02:29:17,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 02:29:17,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:17,243 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:17,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:29:19,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:29:19,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:29:19 BoogieIcfgContainer [2025-01-10 02:29:19,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:29:19,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:29:19,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:29:19,352 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:29:19,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:28:53" (3/4) ... [2025-01-10 02:29:19,354 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:29:19,358 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:29:19,361 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 02:29:19,361 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:29:19,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:29:19,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:29:19,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:29:19,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:29:19,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:29:19,420 INFO L158 Benchmark]: Toolchain (without parser) took 25980.80ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 112.9MB in the beginning and 435.8MB in the end (delta: -322.9MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:19,420 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 226.5MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:19,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.95ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:19,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.55ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:19,421 INFO L158 Benchmark]: Boogie Preprocessor took 17.74ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:19,421 INFO L158 Benchmark]: RCFGBuilder took 333.48ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 81.0MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:29:19,421 INFO L158 Benchmark]: TraceAbstraction took 25373.47ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 80.5MB in the beginning and 444.0MB in the end (delta: -363.5MB). Peak memory consumption was 197.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:19,421 INFO L158 Benchmark]: Witness Printer took 68.03ms. Allocated memory is still 570.4MB. Free memory was 444.0MB in the beginning and 435.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:19,422 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.29ms. Allocated memory is still 226.5MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.95ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.55ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.74ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 99.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 333.48ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 81.0MB in the end (delta: 18.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25373.47ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 80.5MB in the beginning and 444.0MB in the end (delta: -363.5MB). Peak memory consumption was 197.4MB. Max. memory is 16.1GB. * Witness Printer took 68.03ms. Allocated memory is still 570.4MB. Free memory was 444.0MB in the beginning and 435.8MB in the end (delta: 8.1MB). 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - 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: 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: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 26, TraceHistogramMax: 32, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3677 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3603 mSDsluCounter, 7624 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5348 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6051 IncrementalHoareTripleChecker+Invalid, 6554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 2276 mSDtfsCounter, 6051 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4764 GetRequests, 4442 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4065 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433occurred in iteration=21, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 635 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 6292 NumberOfCodeBlocks, 4806 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 7085 ConstructedInterpolants, 4 QuantifiedInterpolants, 24758 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3120 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 48 InterpolantComputations, 14 PerfectInterpolantSequences, 25372/28665 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 52 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((n <= 2147483647) && (3 == t)) && (a == 1)) && (1 <= counter)) && (s == 4)) && (counter <= 5)) || ((((((n <= 2147483647) && (s == 25)) && (9 == t)) && (counter <= 5)) && (4 <= counter)) && (a == 4))) || ((((((n <= 2147483647) && (2 <= counter)) && (5 == t)) && (counter <= 5)) && (9 == s)) && (2 == a))) || ((((((n <= 2147483647) && (16 == s)) && (7 == t)) && (counter <= 5)) && (3 == a)) && (3 <= counter))) || (((((((n <= 2147483647) && (counter == 5)) && (3 <= t)) && (1 <= a)) && (s <= ((__int128) 2147483647 + t))) && (((__int128) s * 4) == ((((__int128) t * t) + ((__int128) 2 * t)) + 1))) && ((((__int128) a * 10) + ((__int128) a * a)) <= 9223372036854775782))) || (((((n <= 2147483647) && (t == 1)) && (counter == 0)) && (a == 0)) && (s == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:29:19,445 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