./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Ackermann02.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/recursive/Ackermann02.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 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:29:28,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:29:28,748 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:29:28,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:29:28,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:29:28,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:29:28,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:29:28,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:29:28,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:29:28,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:29:28,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:29:28,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:29:28,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:29:28,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:29:28,768 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:29:28,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:29:28,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:29:28,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:28,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:28,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:28,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:29:28,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:29:28,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:29:28,772 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 -> 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a [2025-01-10 02:29:28,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:29:28,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:29:28,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:29:28,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:29:28,954 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:29:28,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann02.c [2025-01-10 02:29:30,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f69fbe32f/973445bf207249658ccea2e559870024/FLAG3973efdf0 [2025-01-10 02:29:30,268 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:29:30,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann02.c [2025-01-10 02:29:30,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f69fbe32f/973445bf207249658ccea2e559870024/FLAG3973efdf0 [2025-01-10 02:29:30,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f69fbe32f/973445bf207249658ccea2e559870024 [2025-01-10 02:29:30,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:29:30,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:29:30,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:30,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:29:30,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:29:30,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c928ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30, skipping insertion in model container [2025-01-10 02:29:30,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:29:30,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:30,479 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:29:30,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:30,507 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:29:30,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30 WrapperNode [2025-01-10 02:29:30,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:30,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:30,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:29:30,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:29:30,513 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:29:30" (1/1) ... [2025-01-10 02:29:30,517 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:29:30" (1/1) ... [2025-01-10 02:29:30,527 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-01-10 02:29:30,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:30,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:29:30,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:29:30,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:29:30,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,545 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:29:30,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:29:30,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:29:30,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:29:30,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:29:30,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (1/1) ... [2025-01-10 02:29:30,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:30,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:30,591 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:29:30,596 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:29:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:29:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:29:30,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:29:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2025-01-10 02:29:30,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2025-01-10 02:29:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:29:30,679 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:29:30,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:29:30,813 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-10 02:29:30,813 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:29:30,826 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:29:30,827 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:29:30,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:30 BoogieIcfgContainer [2025-01-10 02:29:30,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:29:30,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:29:30,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:29:30,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:29:30,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:29:30" (1/3) ... [2025-01-10 02:29:30,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cccc64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:30, skipping insertion in model container [2025-01-10 02:29:30,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:30" (2/3) ... [2025-01-10 02:29:30,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cccc64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:30, skipping insertion in model container [2025-01-10 02:29:30,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:30" (3/3) ... [2025-01-10 02:29:30,837 INFO L128 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2025-01-10 02:29:30,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:29:30,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Ackermann02.c that has 2 procedures, 39 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 02:29:30,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:29:30,892 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;@24a7b126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:29:30,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 02:29:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.52) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:29:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:29:30,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:30,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:30,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 180823785, now seen corresponding path program 1 times [2025-01-10 02:29:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430540690] [2025-01-10 02:29:30,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:30,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:29:30,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:29:30,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:30,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:31,037 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:29:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430540690] [2025-01-10 02:29:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430540690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:31,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:31,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:31,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339567647] [2025-01-10 02:29:31,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:31,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:31,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:31,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:31,055 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.52) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:31,146 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-01-10 02:29:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:29:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 02:29:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:31,153 INFO L225 Difference]: With dead ends: 72 [2025-01-10 02:29:31,153 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 02:29:31,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:31,157 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:31,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 02:29:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-01-10 02:29:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:29:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-01-10 02:29:31,184 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 8 [2025-01-10 02:29:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:31,184 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-01-10 02:29:31,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-01-10 02:29:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:29:31,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:31,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:31,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:29:31,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1310575100, now seen corresponding path program 1 times [2025-01-10 02:29:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767472806] [2025-01-10 02:29:31,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:31,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:29:31,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:29:31,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:31,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:31,235 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:29:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767472806] [2025-01-10 02:29:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767472806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:31,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842481777] [2025-01-10 02:29:31,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:31,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:31,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:31,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:31,238 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:31,301 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2025-01-10 02:29:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:29:31,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:29:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:31,303 INFO L225 Difference]: With dead ends: 101 [2025-01-10 02:29:31,303 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 02:29:31,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:31,304 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:31,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 101 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 02:29:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2025-01-10 02:29:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 70 states have internal predecessors, (92), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:29:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2025-01-10 02:29:31,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 9 [2025-01-10 02:29:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:31,314 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2025-01-10 02:29:31,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2025-01-10 02:29:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:29:31,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:31,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:29:31,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:31,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1310570103, now seen corresponding path program 1 times [2025-01-10 02:29:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890698397] [2025-01-10 02:29:31,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:31,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:29:31,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:29:31,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:31,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:31,399 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:29:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890698397] [2025-01-10 02:29:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890698397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652460483] [2025-01-10 02:29:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:31,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:31,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:31,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:31,400 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:31,489 INFO L93 Difference]: Finished difference Result 118 states and 157 transitions. [2025-01-10 02:29:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:29:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:29:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:31,491 INFO L225 Difference]: With dead ends: 118 [2025-01-10 02:29:31,491 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 02:29:31,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:31,492 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:31,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 97 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 02:29:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2025-01-10 02:29:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.445945945945946) internal successors, (107), 83 states have internal predecessors, (107), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 02:29:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2025-01-10 02:29:31,504 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 9 [2025-01-10 02:29:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:31,504 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-01-10 02:29:31,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2025-01-10 02:29:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:29:31,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:31,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:29:31,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:31,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1973122508, now seen corresponding path program 1 times [2025-01-10 02:29:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845285678] [2025-01-10 02:29:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:31,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:29:31,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:29:31,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:31,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:31,577 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:29:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:31,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845285678] [2025-01-10 02:29:31,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845285678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:31,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:31,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583551554] [2025-01-10 02:29:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:31,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:31,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:31,582 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:31,647 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2025-01-10 02:29:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:29:31,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 02:29:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:31,648 INFO L225 Difference]: With dead ends: 110 [2025-01-10 02:29:31,649 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 02:29:31,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:31,649 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:31,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 02:29:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2025-01-10 02:29:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 81 states have internal predecessors, (97), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 02:29:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2025-01-10 02:29:31,661 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 10 [2025-01-10 02:29:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:31,661 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2025-01-10 02:29:31,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2025-01-10 02:29:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:29:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:31,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:31,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:29:31,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:31,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -612398535, now seen corresponding path program 1 times [2025-01-10 02:29:31,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:31,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865999332] [2025-01-10 02:29:31,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:31,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:29:31,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:29:31,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:31,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:31,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865999332] [2025-01-10 02:29:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865999332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:31,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:31,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675120586] [2025-01-10 02:29:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:31,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:31,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:31,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:31,704 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:31,749 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2025-01-10 02:29:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:31,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:29:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:31,751 INFO L225 Difference]: With dead ends: 170 [2025-01-10 02:29:31,751 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 02:29:31,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:29:31,752 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:31,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 89 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 02:29:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-01-10 02:29:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.295774647887324) internal successors, (92), 78 states have internal predecessors, (92), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 02:29:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2025-01-10 02:29:31,762 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 15 [2025-01-10 02:29:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:31,762 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2025-01-10 02:29:31,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2025-01-10 02:29:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:29:31,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:31,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:31,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:29:31,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:31,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -612398311, now seen corresponding path program 1 times [2025-01-10 02:29:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:31,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138981866] [2025-01-10 02:29:31,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:31,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:29:31,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:29:31,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:31,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:31,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138981866] [2025-01-10 02:29:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138981866] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:31,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124823216] [2025-01-10 02:29:31,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:31,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:31,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:31,854 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:29:31,855 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:29:31,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:29:31,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:29:31,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:31,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:31,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:31,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:31,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:31,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124823216] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:31,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 02:29:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179014618] [2025-01-10 02:29:31,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:31,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:29:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:31,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:29:31,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:31,989 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:32,198 INFO L93 Difference]: Finished difference Result 276 states and 359 transitions. [2025-01-10 02:29:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:32,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:29:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:32,200 INFO L225 Difference]: With dead ends: 276 [2025-01-10 02:29:32,200 INFO L226 Difference]: Without dead ends: 274 [2025-01-10 02:29:32,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:29:32,201 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 231 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:32,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 188 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-10 02:29:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 236. [2025-01-10 02:29:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 182 states have (on average 1.2637362637362637) internal successors, (230), 189 states have internal predecessors, (230), 36 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-10 02:29:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 299 transitions. [2025-01-10 02:29:32,248 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 299 transitions. Word has length 15 [2025-01-10 02:29:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:32,248 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 299 transitions. [2025-01-10 02:29:32,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 299 transitions. [2025-01-10 02:29:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:29:32,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:32,248 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:32,255 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:29:32,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:32,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:32,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash -600892461, now seen corresponding path program 1 times [2025-01-10 02:29:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777928715] [2025-01-10 02:29:32,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:32,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:29:32,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:29:32,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:32,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777928715] [2025-01-10 02:29:32,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777928715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396389437] [2025-01-10 02:29:32,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:32,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:32,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:32,549 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:29:32,550 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:29:32,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:29:32,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:29:32,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:32,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:32,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:32,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:32,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396389437] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:32,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:32,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 02:29:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488704297] [2025-01-10 02:29:32,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:32,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:29:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:32,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:29:32,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:32,695 INFO L87 Difference]: Start difference. First operand 236 states and 299 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:32,944 INFO L93 Difference]: Finished difference Result 498 states and 669 transitions. [2025-01-10 02:29:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:29:32,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 02:29:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:32,948 INFO L225 Difference]: With dead ends: 498 [2025-01-10 02:29:32,948 INFO L226 Difference]: Without dead ends: 496 [2025-01-10 02:29:32,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:29:32,951 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 163 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:32,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 158 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-10 02:29:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 445. [2025-01-10 02:29:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 347 states have (on average 1.2276657060518732) internal successors, (426), 354 states have internal predecessors, (426), 69 states have call successors, (69), 24 states have call predecessors, (69), 23 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-10 02:29:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 561 transitions. [2025-01-10 02:29:32,991 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 561 transitions. Word has length 16 [2025-01-10 02:29:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:32,991 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 561 transitions. [2025-01-10 02:29:32,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 561 transitions. [2025-01-10 02:29:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:29:32,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:32,992 INFO L218 NwaCegarLoop]: trace histogram [3, 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:33,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:29:33,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:33,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:33,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1979487198, now seen corresponding path program 1 times [2025-01-10 02:29:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825735443] [2025-01-10 02:29:33,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:33,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:29:33,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:29:33,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:33,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:29:33,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825735443] [2025-01-10 02:29:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825735443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975462138] [2025-01-10 02:29:33,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:33,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:33,306 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:29:33,308 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:29:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:29:33,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:29:33,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:33,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:33,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:33,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:29:33,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975462138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:33,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:33,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-01-10 02:29:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773825546] [2025-01-10 02:29:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:33,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:29:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:33,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:29:33,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:29:33,385 INFO L87 Difference]: Start difference. First operand 445 states and 561 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:29:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:33,532 INFO L93 Difference]: Finished difference Result 494 states and 650 transitions. [2025-01-10 02:29:33,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:33,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-10 02:29:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:33,536 INFO L225 Difference]: With dead ends: 494 [2025-01-10 02:29:33,536 INFO L226 Difference]: Without dead ends: 493 [2025-01-10 02:29:33,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:29:33,538 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:33,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 159 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-10 02:29:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 444. [2025-01-10 02:29:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 347 states have (on average 1.2161383285302594) internal successors, (422), 353 states have internal predecessors, (422), 69 states have call successors, (69), 24 states have call predecessors, (69), 23 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-10 02:29:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 557 transitions. [2025-01-10 02:29:33,572 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 557 transitions. Word has length 24 [2025-01-10 02:29:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 557 transitions. [2025-01-10 02:29:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:29:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 557 transitions. [2025-01-10 02:29:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:29:33,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:33,574 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:33,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:29:33,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:33,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:33,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1234561058, now seen corresponding path program 1 times [2025-01-10 02:29:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:33,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342913882] [2025-01-10 02:29:33,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:33,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:29:33,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:29:33,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:33,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:29:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342913882] [2025-01-10 02:29:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342913882] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99460617] [2025-01-10 02:29:33,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:33,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:33,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:33,880 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:29:33,882 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:29:33,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:29:33,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:29:33,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:33,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:33,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:29:33,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:29:33,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:29:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99460617] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:34,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:34,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 02:29:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711807494] [2025-01-10 02:29:34,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:34,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:29:34,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:34,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:29:34,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:29:34,096 INFO L87 Difference]: Start difference. First operand 444 states and 557 transitions. Second operand has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:29:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:34,308 INFO L93 Difference]: Finished difference Result 765 states and 1085 transitions. [2025-01-10 02:29:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:29:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-01-10 02:29:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:34,312 INFO L225 Difference]: With dead ends: 765 [2025-01-10 02:29:34,312 INFO L226 Difference]: Without dead ends: 763 [2025-01-10 02:29:34,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:29:34,313 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:34,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 163 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-01-10 02:29:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 655. [2025-01-10 02:29:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 491 states have (on average 1.19959266802444) internal successors, (589), 512 states have internal predecessors, (589), 114 states have call successors, (114), 31 states have call predecessors, (114), 45 states have return successors, (134), 111 states have call predecessors, (134), 110 states have call successors, (134) [2025-01-10 02:29:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 837 transitions. [2025-01-10 02:29:34,395 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 837 transitions. Word has length 25 [2025-01-10 02:29:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:34,395 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 837 transitions. [2025-01-10 02:29:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:29:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 837 transitions. [2025-01-10 02:29:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:29:34,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:34,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:34,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:29:34,600 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,SelfDestructingSolverStorable8 [2025-01-10 02:29:34,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2137182870, now seen corresponding path program 1 times [2025-01-10 02:29:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:34,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637625362] [2025-01-10 02:29:34,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:34,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:29:34,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:29:34,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:34,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:34,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637625362] [2025-01-10 02:29:34,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637625362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4138420] [2025-01-10 02:29:34,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:34,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:34,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:34,677 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:29:34,679 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:29:34,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:29:34,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:29:34,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:34,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:34,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:29:34,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:34,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:34,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4138420] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:34,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:34,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-10 02:29:34,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619949492] [2025-01-10 02:29:34,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:34,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:29:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:34,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:29:34,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:29:34,876 INFO L87 Difference]: Start difference. First operand 655 states and 837 transitions. Second operand has 16 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:35,195 INFO L93 Difference]: Finished difference Result 1017 states and 1385 transitions. [2025-01-10 02:29:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 02:29:35,195 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-10 02:29:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:35,199 INFO L225 Difference]: With dead ends: 1017 [2025-01-10 02:29:35,199 INFO L226 Difference]: Without dead ends: 1016 [2025-01-10 02:29:35,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:35,200 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 228 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:35,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 232 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-01-10 02:29:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 931. [2025-01-10 02:29:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 695 states have (on average 1.1697841726618705) internal successors, (813), 728 states have internal predecessors, (813), 162 states have call successors, (162), 43 states have call predecessors, (162), 69 states have return successors, (194), 159 states have call predecessors, (194), 158 states have call successors, (194) [2025-01-10 02:29:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1169 transitions. [2025-01-10 02:29:35,281 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1169 transitions. Word has length 27 [2025-01-10 02:29:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:35,282 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1169 transitions. [2025-01-10 02:29:35,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1169 transitions. [2025-01-10 02:29:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:29:35,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:35,285 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:35,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:35,485 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,SelfDestructingSolverStorable9 [2025-01-10 02:29:35,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:35,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1007222953, now seen corresponding path program 1 times [2025-01-10 02:29:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463241453] [2025-01-10 02:29:35,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:35,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:29:35,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:29:35,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:35,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:29:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463241453] [2025-01-10 02:29:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463241453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913771619] [2025-01-10 02:29:35,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:35,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:35,682 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:29:35,686 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:29:35,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:29:35,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:29:35,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:35,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:35,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 02:29:35,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:29:35,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:29:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913771619] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:35,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 02:29:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644359207] [2025-01-10 02:29:35,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:29:35,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:35,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:29:35,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:29:35,938 INFO L87 Difference]: Start difference. First operand 931 states and 1169 transitions. Second operand has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:29:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:36,302 INFO L93 Difference]: Finished difference Result 1360 states and 1921 transitions. [2025-01-10 02:29:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:29:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-01-10 02:29:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:36,309 INFO L225 Difference]: With dead ends: 1360 [2025-01-10 02:29:36,309 INFO L226 Difference]: Without dead ends: 1348 [2025-01-10 02:29:36,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:36,311 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 108 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:36,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 188 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2025-01-10 02:29:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1161. [2025-01-10 02:29:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 863 states have (on average 1.1657010428736965) internal successors, (1006), 903 states have internal predecessors, (1006), 209 states have call successors, (209), 53 states have call predecessors, (209), 84 states have return successors, (255), 204 states have call predecessors, (255), 202 states have call successors, (255) [2025-01-10 02:29:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1470 transitions. [2025-01-10 02:29:36,422 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1470 transitions. Word has length 27 [2025-01-10 02:29:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1470 transitions. [2025-01-10 02:29:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:29:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1470 transitions. [2025-01-10 02:29:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:29:36,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:36,423 INFO L218 NwaCegarLoop]: trace histogram [4, 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:29:36,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:29:36,625 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,SelfDestructingSolverStorable10 [2025-01-10 02:29:36,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1878013265, now seen corresponding path program 1 times [2025-01-10 02:29:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650819750] [2025-01-10 02:29:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:36,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:29:36,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:29:36,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:36,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:36,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:36,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650819750] [2025-01-10 02:29:36,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650819750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:36,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001216208] [2025-01-10 02:29:36,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:36,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:36,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:36,825 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:29:36,826 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:29:36,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:29:36,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:29:36,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:36,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:36,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:29:36,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:36,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001216208] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:37,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 02:29:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126110462] [2025-01-10 02:29:37,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:37,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 02:29:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:37,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 02:29:37,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:29:37,086 INFO L87 Difference]: Start difference. First operand 1161 states and 1470 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 02:29:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:37,577 INFO L93 Difference]: Finished difference Result 2210 states and 3667 transitions. [2025-01-10 02:29:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:29:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2025-01-10 02:29:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:37,590 INFO L225 Difference]: With dead ends: 2210 [2025-01-10 02:29:37,590 INFO L226 Difference]: Without dead ends: 2172 [2025-01-10 02:29:37,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:29:37,592 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 121 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:37,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 165 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2025-01-10 02:29:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1777. [2025-01-10 02:29:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1272 states have (on average 1.1517295597484276) internal successors, (1465), 1339 states have internal predecessors, (1465), 338 states have call successors, (338), 73 states have call predecessors, (338), 162 states have return successors, (744), 364 states have call predecessors, (744), 323 states have call successors, (744) [2025-01-10 02:29:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2547 transitions. [2025-01-10 02:29:37,750 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2547 transitions. Word has length 34 [2025-01-10 02:29:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:37,750 INFO L471 AbstractCegarLoop]: Abstraction has 1777 states and 2547 transitions. [2025-01-10 02:29:37,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 02:29:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2547 transitions. [2025-01-10 02:29:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:29:37,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:37,751 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-01-10 02:29:37,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:37,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:37,956 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:37,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash 889503256, now seen corresponding path program 1 times [2025-01-10 02:29:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:37,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195940973] [2025-01-10 02:29:37,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:37,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:29:37,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:29:37,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:37,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195940973] [2025-01-10 02:29:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195940973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247975219] [2025-01-10 02:29:38,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:38,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:38,027 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:29:38,029 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:29:38,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:29:38,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:29:38,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:38,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:38,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:29:38,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:38,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247975219] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:38,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:38,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2025-01-10 02:29:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051077996] [2025-01-10 02:29:38,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:38,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:29:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:38,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:29:38,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:29:38,242 INFO L87 Difference]: Start difference. First operand 1777 states and 2547 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:38,526 INFO L93 Difference]: Finished difference Result 2034 states and 3188 transitions. [2025-01-10 02:29:38,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:29:38,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-01-10 02:29:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:38,537 INFO L225 Difference]: With dead ends: 2034 [2025-01-10 02:29:38,538 INFO L226 Difference]: Without dead ends: 2033 [2025-01-10 02:29:38,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:29:38,540 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:38,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 176 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2025-01-10 02:29:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1785. [2025-01-10 02:29:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1280 states have (on average 1.1484375) internal successors, (1470), 1343 states have internal predecessors, (1470), 342 states have call successors, (342), 73 states have call predecessors, (342), 158 states have return successors, (616), 368 states have call predecessors, (616), 327 states have call successors, (616) [2025-01-10 02:29:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2428 transitions. [2025-01-10 02:29:38,754 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2428 transitions. Word has length 36 [2025-01-10 02:29:38,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:38,754 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2428 transitions. [2025-01-10 02:29:38,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2428 transitions. [2025-01-10 02:29:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:29:38,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:38,757 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:38,763 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:38,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:38,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 791091541, now seen corresponding path program 2 times [2025-01-10 02:29:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:38,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395138703] [2025-01-10 02:29:38,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:38,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-10 02:29:38,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:29:38,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:38,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:29:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395138703] [2025-01-10 02:29:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395138703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188035308] [2025-01-10 02:29:39,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:39,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:39,123 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:39,125 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:39,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-10 02:29:39,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:29:39,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:39,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:39,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:29:39,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:29:39,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:29:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188035308] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:39,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:39,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-01-10 02:29:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946651679] [2025-01-10 02:29:39,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:29:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:39,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:29:39,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:39,361 INFO L87 Difference]: Start difference. First operand 1785 states and 2428 transitions. Second operand has 22 states, 19 states have (on average 3.0) internal successors, (57), 16 states have internal predecessors, (57), 8 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:29:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:40,001 INFO L93 Difference]: Finished difference Result 2842 states and 4279 transitions. [2025-01-10 02:29:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-10 02:29:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.0) internal successors, (57), 16 states have internal predecessors, (57), 8 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-01-10 02:29:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:40,016 INFO L225 Difference]: With dead ends: 2842 [2025-01-10 02:29:40,016 INFO L226 Difference]: Without dead ends: 2841 [2025-01-10 02:29:40,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=1301, Unknown=0, NotChecked=0, Total=1640 [2025-01-10 02:29:40,019 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 361 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:40,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 258 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:29:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2025-01-10 02:29:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2615. [2025-01-10 02:29:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 1874 states have (on average 1.1408751334044824) internal successors, (2138), 1971 states have internal predecessors, (2138), 498 states have call successors, (498), 107 states have call predecessors, (498), 238 states have return successors, (922), 536 states have call predecessors, (922), 483 states have call successors, (922) [2025-01-10 02:29:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 3558 transitions. [2025-01-10 02:29:40,225 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 3558 transitions. Word has length 43 [2025-01-10 02:29:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:40,225 INFO L471 AbstractCegarLoop]: Abstraction has 2615 states and 3558 transitions. [2025-01-10 02:29:40,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.0) internal successors, (57), 16 states have internal predecessors, (57), 8 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:29:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3558 transitions. [2025-01-10 02:29:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:29:40,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:40,227 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 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] [2025-01-10 02:29:40,236 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:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:40,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:40,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash -328093970, now seen corresponding path program 2 times [2025-01-10 02:29:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178939368] [2025-01-10 02:29:40,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:40,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 02:29:40,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:29:40,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:40,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:40,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178939368] [2025-01-10 02:29:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178939368] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833737466] [2025-01-10 02:29:40,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:40,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:40,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:40,516 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:40,516 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:40,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 02:29:40,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:29:40,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:40,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:29:40,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:40,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:29:40,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833737466] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:40,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:40,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-01-10 02:29:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013274258] [2025-01-10 02:29:40,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:40,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:29:40,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:40,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:29:40,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:40,795 INFO L87 Difference]: Start difference. First operand 2615 states and 3558 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 02:29:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:41,835 INFO L93 Difference]: Finished difference Result 5426 states and 9019 transitions. [2025-01-10 02:29:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-10 02:29:41,836 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2025-01-10 02:29:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:41,859 INFO L225 Difference]: With dead ends: 5426 [2025-01-10 02:29:41,859 INFO L226 Difference]: Without dead ends: 3895 [2025-01-10 02:29:41,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=2049, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 02:29:41,875 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 177 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:41,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 358 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:29:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2025-01-10 02:29:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 2888. [2025-01-10 02:29:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2074 states have (on average 1.1374156219864995) internal successors, (2359), 2180 states have internal predecessors, (2359), 547 states have call successors, (547), 122 states have call predecessors, (547), 262 states have return successors, (1006), 585 states have call predecessors, (1006), 532 states have call successors, (1006) [2025-01-10 02:29:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3912 transitions. [2025-01-10 02:29:42,214 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3912 transitions. Word has length 44 [2025-01-10 02:29:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:42,214 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3912 transitions. [2025-01-10 02:29:42,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 16 states have internal predecessors, (61), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 02:29:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3912 transitions. [2025-01-10 02:29:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:29:42,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:42,216 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:42,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:29:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 02:29:42,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:42,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1781931564, now seen corresponding path program 1 times [2025-01-10 02:29:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973663120] [2025-01-10 02:29:42,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:42,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 02:29:42,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:29:42,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:42,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:29:42,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:42,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973663120] [2025-01-10 02:29:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973663120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:42,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318587035] [2025-01-10 02:29:42,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:42,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:42,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:42,461 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:42,463 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:42,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 02:29:42,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:29:42,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:42,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:42,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:42,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:29:42,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 02:29:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318587035] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:42,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-10 02:29:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252347938] [2025-01-10 02:29:42,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:42,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:29:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:42,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:29:42,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:29:42,598 INFO L87 Difference]: Start difference. First operand 2888 states and 3912 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:29:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:42,821 INFO L93 Difference]: Finished difference Result 4468 states and 6527 transitions. [2025-01-10 02:29:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:29:42,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-01-10 02:29:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:42,832 INFO L225 Difference]: With dead ends: 4468 [2025-01-10 02:29:42,832 INFO L226 Difference]: Without dead ends: 2476 [2025-01-10 02:29:42,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:29:42,843 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 95 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:42,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 92 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2025-01-10 02:29:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 1703. [2025-01-10 02:29:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1310 states have (on average 1.1778625954198474) internal successors, (1543), 1353 states have internal predecessors, (1543), 249 states have call successors, (249), 116 states have call predecessors, (249), 139 states have return successors, (368), 233 states have call predecessors, (368), 218 states have call successors, (368) [2025-01-10 02:29:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2160 transitions. [2025-01-10 02:29:43,011 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2160 transitions. Word has length 44 [2025-01-10 02:29:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,012 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2160 transitions. [2025-01-10 02:29:43,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:29:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2160 transitions. [2025-01-10 02:29:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:29:43,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,014 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 02:29:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 02:29:43,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:43,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1331455508, now seen corresponding path program 1 times [2025-01-10 02:29:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250836467] [2025-01-10 02:29:43,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:43,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:29:43,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:29:43,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:29:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250836467] [2025-01-10 02:29:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250836467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273619090] [2025-01-10 02:29:43,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:43,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:43,316 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:43,317 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:43,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:29:43,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:29:43,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:29:43,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:29:43,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:29:43,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273619090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:43,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:43,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2025-01-10 02:29:43,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360611588] [2025-01-10 02:29:43,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:43,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:29:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:43,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:29:43,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:29:43,522 INFO L87 Difference]: Start difference. First operand 1703 states and 2160 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:29:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:43,873 INFO L93 Difference]: Finished difference Result 1987 states and 2619 transitions. [2025-01-10 02:29:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-01-10 02:29:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:43,881 INFO L225 Difference]: With dead ends: 1987 [2025-01-10 02:29:43,881 INFO L226 Difference]: Without dead ends: 1807 [2025-01-10 02:29:43,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:29:43,882 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:43,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 154 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-01-10 02:29:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1729. [2025-01-10 02:29:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1331 states have (on average 1.175807663410969) internal successors, (1565), 1373 states have internal predecessors, (1565), 254 states have call successors, (254), 119 states have call predecessors, (254), 139 states have return successors, (370), 236 states have call predecessors, (370), 220 states have call successors, (370) [2025-01-10 02:29:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2189 transitions. [2025-01-10 02:29:43,987 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2189 transitions. Word has length 51 [2025-01-10 02:29:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,987 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2189 transitions. [2025-01-10 02:29:43,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:29:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2189 transitions. [2025-01-10 02:29:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 02:29:43,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,989 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,998 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:44,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:29:44,190 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:44,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash -603852535, now seen corresponding path program 1 times [2025-01-10 02:29:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364903491] [2025-01-10 02:29:44,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:44,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 02:29:44,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 02:29:44,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:44,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 02:29:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364903491] [2025-01-10 02:29:44,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364903491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344877815] [2025-01-10 02:29:44,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:44,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:44,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:44,357 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:44,358 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:44,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 02:29:44,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 02:29:44,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:44,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:44,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:29:44,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 02:29:44,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 02:29:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344877815] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:44,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:44,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2025-01-10 02:29:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368576748] [2025-01-10 02:29:44,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:44,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 02:29:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:44,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 02:29:44,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:29:44,798 INFO L87 Difference]: Start difference. First operand 1729 states and 2189 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:46,599 INFO L93 Difference]: Finished difference Result 4144 states and 7114 transitions. [2025-01-10 02:29:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-10 02:29:46,600 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 53 [2025-01-10 02:29:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:46,623 INFO L225 Difference]: With dead ends: 4144 [2025-01-10 02:29:46,624 INFO L226 Difference]: Without dead ends: 4138 [2025-01-10 02:29:46,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1475, Invalid=7081, Unknown=0, NotChecked=0, Total=8556 [2025-01-10 02:29:46,629 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 178 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:46,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 233 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:29:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2025-01-10 02:29:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2962. [2025-01-10 02:29:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2131 states have (on average 1.1426560300328483) internal successors, (2435), 2176 states have internal predecessors, (2435), 500 states have call successors, (500), 148 states have call predecessors, (500), 326 states have return successors, (2371), 637 states have call predecessors, (2371), 455 states have call successors, (2371) [2025-01-10 02:29:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 5306 transitions. [2025-01-10 02:29:46,947 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 5306 transitions. Word has length 53 [2025-01-10 02:29:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:46,948 INFO L471 AbstractCegarLoop]: Abstraction has 2962 states and 5306 transitions. [2025-01-10 02:29:46,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 5306 transitions. [2025-01-10 02:29:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 02:29:46,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:46,953 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:46,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 02:29:47,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:29:47,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash 38844242, now seen corresponding path program 1 times [2025-01-10 02:29:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:47,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525034953] [2025-01-10 02:29:47,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:47,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:29:47,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:29:47,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:47,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:29:47,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:47,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525034953] [2025-01-10 02:29:47,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525034953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:47,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235899047] [2025-01-10 02:29:47,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:47,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:47,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:47,276 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:47,279 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:47,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:29:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:29:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:47,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:47,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:29:47,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:29:47,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:29:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235899047] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:47,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 02:29:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282040807] [2025-01-10 02:29:47,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:47,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 02:29:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:47,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 02:29:47,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:29:47,538 INFO L87 Difference]: Start difference. First operand 2962 states and 5306 transitions. Second operand has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (16), 10 states have call predecessors, (16), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:48,476 INFO L93 Difference]: Finished difference Result 8474 states and 15426 transitions. [2025-01-10 02:29:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 02:29:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (16), 10 states have call predecessors, (16), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-10 02:29:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:48,512 INFO L225 Difference]: With dead ends: 8474 [2025-01-10 02:29:48,513 INFO L226 Difference]: Without dead ends: 8472 [2025-01-10 02:29:48,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 02:29:48,518 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 497 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:48,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 357 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:29:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2025-01-10 02:29:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8242. [2025-01-10 02:29:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8242 states, 5995 states have (on average 1.1457881567973311) internal successors, (6869), 6112 states have internal predecessors, (6869), 1370 states have call successors, (1370), 442 states have call predecessors, (1370), 872 states have return successors, (6355), 1687 states have call predecessors, (6355), 1253 states have call successors, (6355) [2025-01-10 02:29:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8242 states to 8242 states and 14594 transitions. [2025-01-10 02:29:49,435 INFO L78 Accepts]: Start accepts. Automaton has 8242 states and 14594 transitions. Word has length 57 [2025-01-10 02:29:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:49,435 INFO L471 AbstractCegarLoop]: Abstraction has 8242 states and 14594 transitions. [2025-01-10 02:29:49,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.652173913043478) internal successors, (84), 14 states have internal predecessors, (84), 10 states have call successors, (16), 10 states have call predecessors, (16), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8242 states and 14594 transitions. [2025-01-10 02:29:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 02:29:49,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:49,438 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:49,447 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:49,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:49,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:49,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash -476681264, now seen corresponding path program 1 times [2025-01-10 02:29:49,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:49,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141468769] [2025-01-10 02:29:49,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 02:29:49,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 02:29:49,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:49,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 02:29:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141468769] [2025-01-10 02:29:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141468769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84754936] [2025-01-10 02:29:49,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:49,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:49,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:49,814 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:49,818 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:49,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 02:29:49,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 02:29:49,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:49,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:49,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:29:49,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 02:29:49,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 02:29:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84754936] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:50,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2025-01-10 02:29:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233530113] [2025-01-10 02:29:50,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 02:29:50,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:50,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 02:29:50,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:29:50,276 INFO L87 Difference]: Start difference. First operand 8242 states and 14594 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:54,592 INFO L93 Difference]: Finished difference Result 34035 states and 100296 transitions. [2025-01-10 02:29:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-01-10 02:29:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2025-01-10 02:29:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:54,935 INFO L225 Difference]: With dead ends: 34035 [2025-01-10 02:29:54,935 INFO L226 Difference]: Without dead ends: 26532 [2025-01-10 02:29:55,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1752, Invalid=7560, Unknown=0, NotChecked=0, Total=9312 [2025-01-10 02:29:55,071 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 175 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:55,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 388 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 02:29:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26532 states. [2025-01-10 02:29:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26532 to 18475. [2025-01-10 02:29:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18475 states, 12326 states have (on average 1.0888366055492456) internal successors, (13421), 12461 states have internal predecessors, (13421), 3618 states have call successors, (3618), 570 states have call predecessors, (3618), 2526 states have return successors, (38824), 5443 states have call predecessors, (38824), 3469 states have call successors, (38824) [2025-01-10 02:29:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18475 states to 18475 states and 55863 transitions. [2025-01-10 02:29:58,069 INFO L78 Accepts]: Start accepts. Automaton has 18475 states and 55863 transitions. Word has length 55 [2025-01-10 02:29:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:58,069 INFO L471 AbstractCegarLoop]: Abstraction has 18475 states and 55863 transitions. [2025-01-10 02:29:58,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 5 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18475 states and 55863 transitions. [2025-01-10 02:29:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 02:29:58,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:58,072 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:58,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 02:29:58,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:58,274 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:29:58,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1608770754, now seen corresponding path program 2 times [2025-01-10 02:29:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:58,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878594549] [2025-01-10 02:29:58,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:58,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 02:29:58,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:29:58,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:58,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878594549] [2025-01-10 02:29:58,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878594549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668216544] [2025-01-10 02:29:58,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:58,442 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:58,445 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:58,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 02:29:58,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:29:58,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:58,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:58,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:29:58,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:58,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668216544] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:58,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-01-10 02:29:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984798069] [2025-01-10 02:29:58,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 02:29:58,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:58,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 02:29:58,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2025-01-10 02:29:58,797 INFO L87 Difference]: Start difference. First operand 18475 states and 55863 transitions. Second operand has 32 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 18 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:03,894 INFO L93 Difference]: Finished difference Result 26093 states and 77665 transitions. [2025-01-10 02:30:03,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-10 02:30:03,898 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 18 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-01-10 02:30:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:04,075 INFO L225 Difference]: With dead ends: 26093 [2025-01-10 02:30:04,075 INFO L226 Difference]: Without dead ends: 26092 [2025-01-10 02:30:04,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 02:30:04,095 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 635 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:04,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 454 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:30:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26092 states. [2025-01-10 02:30:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26092 to 25067. [2025-01-10 02:30:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25067 states, 16694 states have (on average 1.082844135617587) internal successors, (18077), 16909 states have internal predecessors, (18077), 4802 states have call successors, (4802), 714 states have call predecessors, (4802), 3566 states have return successors, (51688), 7443 states have call predecessors, (51688), 4653 states have call successors, (51688) [2025-01-10 02:30:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25067 states to 25067 states and 74567 transitions. [2025-01-10 02:30:07,576 INFO L78 Accepts]: Start accepts. Automaton has 25067 states and 74567 transitions. Word has length 59 [2025-01-10 02:30:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:07,576 INFO L471 AbstractCegarLoop]: Abstraction has 25067 states and 74567 transitions. [2025-01-10 02:30:07,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 18 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 25067 states and 74567 transitions. [2025-01-10 02:30:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 02:30:07,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:07,579 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:07,587 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:30:07,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:07,780 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:07,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1055434239, now seen corresponding path program 3 times [2025-01-10 02:30:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:07,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914408213] [2025-01-10 02:30:07,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:07,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 6 equivalence classes. [2025-01-10 02:30:07,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 51 of 59 statements. [2025-01-10 02:30:07,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 02:30:07,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 02:30:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:07,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914408213] [2025-01-10 02:30:07,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914408213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:07,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:30:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180127607] [2025-01-10 02:30:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:07,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:07,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:07,848 INFO L87 Difference]: Start difference. First operand 25067 states and 74567 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:30:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:10,392 INFO L93 Difference]: Finished difference Result 25996 states and 77216 transitions. [2025-01-10 02:30:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-01-10 02:30:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:10,615 INFO L225 Difference]: With dead ends: 25996 [2025-01-10 02:30:10,615 INFO L226 Difference]: Without dead ends: 21293 [2025-01-10 02:30:10,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:30:10,656 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:10,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 54 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21293 states. [2025-01-10 02:30:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21293 to 21139. [2025-01-10 02:30:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21139 states, 13440 states have (on average 1.0405505952380953) internal successors, (13985), 13493 states have internal predecessors, (13985), 4411 states have call successors, (4411), 331 states have call predecessors, (4411), 3283 states have return successors, (51104), 7314 states have call predecessors, (51104), 4400 states have call successors, (51104) [2025-01-10 02:30:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21139 states to 21139 states and 69500 transitions. [2025-01-10 02:30:15,038 INFO L78 Accepts]: Start accepts. Automaton has 21139 states and 69500 transitions. Word has length 59 [2025-01-10 02:30:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:15,038 INFO L471 AbstractCegarLoop]: Abstraction has 21139 states and 69500 transitions. [2025-01-10 02:30:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:30:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21139 states and 69500 transitions. [2025-01-10 02:30:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 02:30:15,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:15,040 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:15,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 02:30:15,041 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:30:15,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash -295397423, now seen corresponding path program 2 times [2025-01-10 02:30:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133219733] [2025-01-10 02:30:15,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:15,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:15,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-10 02:30:15,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 02:30:15,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:15,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 83 proven. 19 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 02:30:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133219733] [2025-01-10 02:30:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133219733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092706230] [2025-01-10 02:30:15,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:15,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:15,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:15,225 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:30:15,226 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:30:15,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-10 02:30:15,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 02:30:15,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:15,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:15,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 02:30:15,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 75 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-10 02:30:15,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 94 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 02:30:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092706230] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:15,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 31 [2025-01-10 02:30:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818063930] [2025-01-10 02:30:15,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:15,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 02:30:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:15,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 02:30:15,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-01-10 02:30:15,984 INFO L87 Difference]: Start difference. First operand 21139 states and 69500 transitions. Second operand has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 22 states have internal predecessors, (74), 7 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-10 02:30:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:19,001 INFO L93 Difference]: Finished difference Result 34877 states and 114689 transitions. [2025-01-10 02:30:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-10 02:30:19,001 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 22 states have internal predecessors, (74), 7 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) Word has length 80 [2025-01-10 02:30:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:19,066 INFO L225 Difference]: With dead ends: 34877 [2025-01-10 02:30:19,066 INFO L226 Difference]: Without dead ends: 14268 [2025-01-10 02:30:19,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1007, Invalid=4693, Unknown=0, NotChecked=0, Total=5700 [2025-01-10 02:30:19,328 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 162 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:19,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 454 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:30:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states.