./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:26:39,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:26:39,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:26:39,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:26:39,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:26:39,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:26:39,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:26:39,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:26:39,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:26:39,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:26:39,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:26:39,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:26:39,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:26:39,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:26:39,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:26:39,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:26:39,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:26:39,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:26:39,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:26:39,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:26:39,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a [2025-03-04 11:26:39,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:26:39,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:26:39,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:26:39,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:26:39,852 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:26:39,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann02.c [2025-03-04 11:26:40,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef9e8331/df94d0e242334314af84a60358cca007/FLAGdc3dd067f [2025-03-04 11:26:41,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:26:41,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann02.c [2025-03-04 11:26:41,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef9e8331/df94d0e242334314af84a60358cca007/FLAGdc3dd067f [2025-03-04 11:26:41,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef9e8331/df94d0e242334314af84a60358cca007 [2025-03-04 11:26:41,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:26:41,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:26:41,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:26:41,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:26:41,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:26:41,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41, skipping insertion in model container [2025-03-04 11:26:41,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:26:41,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:26:41,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:26:41,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:26:41,414 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:26:41,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41 WrapperNode [2025-03-04 11:26:41,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:26:41,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:26:41,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:26:41,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:26:41,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,436 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-03-04 11:26:41,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:26:41,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:26:41,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:26:41,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:26:41,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,452 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-03-04 11:26:41,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:26:41,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:26:41,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:26:41,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:26:41,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (1/1) ... [2025-03-04 11:26:41,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:26:41,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:41,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:26:41,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:26:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:26:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:26:41,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:26:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2025-03-04 11:26:41,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2025-03-04 11:26:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:26:41,548 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:26:41,549 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:26:41,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5;havoc #t~ret6; [2025-03-04 11:26:41,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4; [2025-03-04 11:26:41,664 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-04 11:26:41,666 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:26:41,672 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:26:41,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:26:41,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:26:41 BoogieIcfgContainer [2025-03-04 11:26:41,673 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:26:41,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:26:41,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:26:41,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:26:41,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:26:41" (1/3) ... [2025-03-04 11:26:41,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186707b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:26:41, skipping insertion in model container [2025-03-04 11:26:41,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:26:41" (2/3) ... [2025-03-04 11:26:41,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186707b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:26:41, skipping insertion in model container [2025-03-04 11:26:41,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:26:41" (3/3) ... [2025-03-04 11:26:41,681 INFO L128 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2025-03-04 11:26:41,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:26:41,695 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-03-04 11:26:41,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:26:41,747 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;@5f30fa71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:26:41,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 11:26:41,751 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-03-04 11:26:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:26:41,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:41,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:41,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:41,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -489113992, now seen corresponding path program 1 times [2025-03-04 11:26:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:41,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909211966] [2025-03-04 11:26:41,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:41,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:26:41,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:26:41,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:41,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909211966] [2025-03-04 11:26:41,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909211966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:41,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:26:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207676874] [2025-03-04 11:26:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:41,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:26:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:41,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:26:41,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:26:41,957 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-03-04 11:26:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:42,063 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-03-04 11:26:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:26:42,065 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-03-04 11:26:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:42,069 INFO L225 Difference]: With dead ends: 72 [2025-03-04 11:26:42,069 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 11:26:42,071 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-03-04 11:26:42,073 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03-04 11:26:42,073 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-03-04 11:26:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 11:26:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-03-04 11:26:42,099 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-03-04 11:26:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-03-04 11:26:42,106 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 8 [2025-03-04 11:26:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:42,106 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-04 11:26:42,106 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-03-04 11:26:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-03-04 11:26:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:26:42,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:42,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:42,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:26:42,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:42,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2017335443, now seen corresponding path program 1 times [2025-03-04 11:26:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:42,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952719366] [2025-03-04 11:26:42,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:42,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:26:42,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:26:42,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:42,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952719366] [2025-03-04 11:26:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952719366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:26:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916567916] [2025-03-04 11:26:42,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:42,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:26:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:42,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:26:42,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:26:42,168 INFO L87 Difference]: Start difference. First operand 51 states and 65 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-03-04 11:26:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:42,249 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2025-03-04 11:26:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:26:42,250 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-03-04 11:26:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:42,251 INFO L225 Difference]: With dead ends: 82 [2025-03-04 11:26:42,252 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:26:42,253 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-03-04 11:26:42,253 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:42,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 100 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:26:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2025-03-04 11:26:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.489795918367347) internal successors, (73), 57 states have internal predecessors, (73), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:26:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-03-04 11:26:42,267 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 9 [2025-03-04 11:26:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:42,268 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-03-04 11:26:42,268 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-03-04 11:26:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-03-04 11:26:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:26:42,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:42,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:26:42,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2017336276, now seen corresponding path program 1 times [2025-03-04 11:26:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413030120] [2025-03-04 11:26:42,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:42,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:26:42,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:26:42,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:42,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:42,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413030120] [2025-03-04 11:26:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413030120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:26:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341922506] [2025-03-04 11:26:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:26:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:42,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:26:42,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:26:42,324 INFO L87 Difference]: Start difference. First operand 70 states and 92 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-03-04 11:26:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:42,408 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2025-03-04 11:26:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:26:42,409 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-03-04 11:26:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:42,410 INFO L225 Difference]: With dead ends: 118 [2025-03-04 11:26:42,410 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 11:26:42,410 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-03-04 11:26:42,410 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:42,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 11:26:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-03-04 11:26:42,420 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-03-04 11:26:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2025-03-04 11:26:42,423 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 9 [2025-03-04 11:26:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:42,423 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-03-04 11:26:42,423 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-03-04 11:26:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2025-03-04 11:26:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:26:42,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:42,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:42,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:26:42,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:42,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1887084879, now seen corresponding path program 1 times [2025-03-04 11:26:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:42,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021048278] [2025-03-04 11:26:42,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:42,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:26:42,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:26:42,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:42,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:42,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021048278] [2025-03-04 11:26:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021048278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:42,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:42,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:26:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156695853] [2025-03-04 11:26:42,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:42,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:26:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:42,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:26:42,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:26:42,493 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-03-04 11:26:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:42,545 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2025-03-04 11:26:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:26:42,546 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-03-04 11:26:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:42,547 INFO L225 Difference]: With dead ends: 110 [2025-03-04 11:26:42,547 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 11:26:42,547 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-03-04 11:26:42,548 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-03-04 11:26:42,548 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-03-04 11:26:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 11:26:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2025-03-04 11:26:42,562 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-03-04 11:26:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2025-03-04 11:26:42,566 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 10 [2025-03-04 11:26:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:42,566 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2025-03-04 11:26:42,566 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-03-04 11:26:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2025-03-04 11:26:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:26:42,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:42,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:42,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:26:42,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:42,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash -224957691, now seen corresponding path program 1 times [2025-03-04 11:26:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:42,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319718186] [2025-03-04 11:26:42,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:42,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:42,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:26:42,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:26:42,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:42,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:42,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319718186] [2025-03-04 11:26:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319718186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:26:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:26:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276707574] [2025-03-04 11:26:42,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:42,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:26:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:42,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:26:42,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:26:42,623 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-03-04 11:26:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:42,675 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2025-03-04 11:26:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:26:42,676 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-03-04 11:26:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:42,677 INFO L225 Difference]: With dead ends: 170 [2025-03-04 11:26:42,677 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 11:26:42,679 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-03-04 11:26:42,681 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-03-04 11:26:42,681 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-03-04 11:26:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 11:26:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-03-04 11:26:42,692 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-03-04 11:26:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2025-03-04 11:26:42,697 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 15 [2025-03-04 11:26:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2025-03-04 11:26:42,698 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-03-04 11:26:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2025-03-04 11:26:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:26:42,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:42,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:42,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:26:42,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:42,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -224957667, now seen corresponding path program 1 times [2025-03-04 11:26:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:42,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709073188] [2025-03-04 11:26:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:42,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:26:42,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:26:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709073188] [2025-03-04 11:26:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709073188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181045215] [2025-03-04 11:26:42,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:42,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:42,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:42,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:42,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:26:42,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:26:42,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:26:42,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:42,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:42,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:26:42,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:42,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181045215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:42,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:26:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301935326] [2025-03-04 11:26:42,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:42,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:26:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:42,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:26:42,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:26:42,910 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-03-04 11:26:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:43,118 INFO L93 Difference]: Finished difference Result 276 states and 359 transitions. [2025-03-04 11:26:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:26:43,119 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-03-04 11:26:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:43,122 INFO L225 Difference]: With dead ends: 276 [2025-03-04 11:26:43,123 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 11:26:43,123 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-03-04 11:26:43,124 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 217 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:43,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 201 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 11:26:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 236. [2025-03-04 11:26:43,158 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-03-04 11:26:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 299 transitions. [2025-03-04 11:26:43,162 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 299 transitions. Word has length 15 [2025-03-04 11:26:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:43,162 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 299 transitions. [2025-03-04 11:26:43,162 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-03-04 11:26:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 299 transitions. [2025-03-04 11:26:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:26:43,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:43,163 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:43,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:43,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 11:26:43,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2020160200, now seen corresponding path program 1 times [2025-03-04 11:26:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097050405] [2025-03-04 11:26:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:26:43,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:26:43,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:43,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097050405] [2025-03-04 11:26:43,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097050405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80032925] [2025-03-04 11:26:43,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:43,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:43,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:43,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:26:43,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:26:43,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:26:43,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:43,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:43,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:26:43,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:43,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:26:43,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80032925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:43,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:26:43,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:26:43,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210807918] [2025-03-04 11:26:43,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:43,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:26:43,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:43,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:26:43,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:26:43,509 INFO L87 Difference]: Start difference. First operand 236 states and 299 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 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-03-04 11:26:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:43,601 INFO L93 Difference]: Finished difference Result 328 states and 437 transitions. [2025-03-04 11:26:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:26:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 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 16 [2025-03-04 11:26:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:43,605 INFO L225 Difference]: With dead ends: 328 [2025-03-04 11:26:43,605 INFO L226 Difference]: Without dead ends: 327 [2025-03-04 11:26:43,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:26:43,606 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:43,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-04 11:26:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 293. [2025-03-04 11:26:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 227 states have (on average 1.2599118942731278) internal successors, (286), 234 states have internal predecessors, (286), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 11:26:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 373 transitions. [2025-03-04 11:26:43,642 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 373 transitions. Word has length 16 [2025-03-04 11:26:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:43,643 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 373 transitions. [2025-03-04 11:26:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 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-03-04 11:26:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 373 transitions. [2025-03-04 11:26:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:26:43,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:43,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:43,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:43,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 11:26:43,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:43,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1511600730, now seen corresponding path program 1 times [2025-03-04 11:26:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:43,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343462806] [2025-03-04 11:26:43,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:43,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:26:43,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:26:43,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:43,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:43,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343462806] [2025-03-04 11:26:43,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343462806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:43,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775149296] [2025-03-04 11:26:43,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:43,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:43,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:43,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:43,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:26:43,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:26:43,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:26:43,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:43,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:43,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:26:43,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:43,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775149296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:44,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 11:26:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844682623] [2025-03-04 11:26:44,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:44,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:26:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:44,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:26:44,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:26:44,038 INFO L87 Difference]: Start difference. First operand 293 states and 373 transitions. Second operand has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-04 11:26:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:44,221 INFO L93 Difference]: Finished difference Result 577 states and 766 transitions. [2025-03-04 11:26:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:26:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 19 [2025-03-04 11:26:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:44,228 INFO L225 Difference]: With dead ends: 577 [2025-03-04 11:26:44,228 INFO L226 Difference]: Without dead ends: 576 [2025-03-04 11:26:44,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 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-03-04 11:26:44,229 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 158 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:44,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 193 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-04 11:26:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 521. [2025-03-04 11:26:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 407 states have (on average 1.203931203931204) internal successors, (490), 414 states have internal predecessors, (490), 81 states have call successors, (81), 28 states have call predecessors, (81), 27 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 11:26:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 649 transitions. [2025-03-04 11:26:44,261 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 649 transitions. Word has length 19 [2025-03-04 11:26:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:44,262 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 649 transitions. [2025-03-04 11:26:44,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-03-04 11:26:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 649 transitions. [2025-03-04 11:26:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:26:44,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:44,262 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-03-04 11:26:44,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:44,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:44,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1980210359, now seen corresponding path program 1 times [2025-03-04 11:26:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919779673] [2025-03-04 11:26:44,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:26:44,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:26:44,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:44,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:26:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:44,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919779673] [2025-03-04 11:26:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919779673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:44,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501329205] [2025-03-04 11:26:44,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:44,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:44,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:44,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:26:44,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:26:44,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:26:44,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:44,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:44,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:26:44,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:26:44,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:26:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501329205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:44,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 11:26:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601712085] [2025-03-04 11:26:44,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:26:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:44,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:26:44,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:26:44,688 INFO L87 Difference]: Start difference. First operand 521 states and 649 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 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-03-04 11:26:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:45,074 INFO L93 Difference]: Finished difference Result 1306 states and 1818 transitions. [2025-03-04 11:26:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 11:26:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 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 24 [2025-03-04 11:26:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:45,078 INFO L225 Difference]: With dead ends: 1306 [2025-03-04 11:26:45,079 INFO L226 Difference]: Without dead ends: 915 [2025-03-04 11:26:45,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:26:45,081 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 159 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:45,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 99 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-04 11:26:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 715. [2025-03-04 11:26:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 560 states have (on average 1.1982142857142857) internal successors, (671), 581 states have internal predecessors, (671), 103 states have call successors, (103), 47 states have call predecessors, (103), 46 states have return successors, (106), 86 states have call predecessors, (106), 78 states have call successors, (106) [2025-03-04 11:26:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 880 transitions. [2025-03-04 11:26:45,133 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 880 transitions. Word has length 24 [2025-03-04 11:26:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:45,133 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 880 transitions. [2025-03-04 11:26:45,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 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-03-04 11:26:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 880 transitions. [2025-03-04 11:26:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:26:45,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:45,134 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:45,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:26:45,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:45,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:45,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1184768225, now seen corresponding path program 1 times [2025-03-04 11:26:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:45,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888987887] [2025-03-04 11:26:45,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:45,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:26:45,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:26:45,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:45,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:26:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888987887] [2025-03-04 11:26:45,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888987887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416631200] [2025-03-04 11:26:45,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:45,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:45,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:45,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:45,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:26:45,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:26:45,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:26:45,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:45,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:45,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:26:45,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:26:45,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:26:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416631200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:26:45,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:26:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-04 11:26:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630239890] [2025-03-04 11:26:45,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:45,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:26:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:45,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:26:45,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:26:45,459 INFO L87 Difference]: Start difference. First operand 715 states and 880 transitions. Second operand has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-03-04 11:26:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:45,545 INFO L93 Difference]: Finished difference Result 762 states and 976 transitions. [2025-03-04 11:26:45,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:26:45,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 28 [2025-03-04 11:26:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:45,550 INFO L225 Difference]: With dead ends: 762 [2025-03-04 11:26:45,550 INFO L226 Difference]: Without dead ends: 761 [2025-03-04 11:26:45,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:26:45,551 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:45,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 110 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:26:45,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-04 11:26:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 686. [2025-03-04 11:26:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 534 states have (on average 1.1779026217228465) internal successors, (629), 556 states have internal predecessors, (629), 101 states have call successors, (101), 43 states have call predecessors, (101), 46 states have return successors, (106), 86 states have call predecessors, (106), 78 states have call successors, (106) [2025-03-04 11:26:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 836 transitions. [2025-03-04 11:26:45,595 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 836 transitions. Word has length 28 [2025-03-04 11:26:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:45,595 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 836 transitions. [2025-03-04 11:26:45,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-03-04 11:26:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 836 transitions. [2025-03-04 11:26:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:26:45,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:45,597 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:45,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:45,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 11:26:45,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:45,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1930986427, now seen corresponding path program 1 times [2025-03-04 11:26:45,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:45,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-03-04 11:26:45,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:45,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:45,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:26:45,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:26:45,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:45,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-03-04 11:26:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587925555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482953144] [2025-03-04 11:26:45,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:45,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:45,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:45,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:45,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:26:45,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:26:45,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:26:45,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:45,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:45,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:26:45,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:45,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:46,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482953144] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:46,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:46,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2025-03-04 11:26:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389548936] [2025-03-04 11:26:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:46,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:26:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:46,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:26:46,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:26:46,148 INFO L87 Difference]: Start difference. First operand 686 states and 836 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-03-04 11:26:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:46,373 INFO L93 Difference]: Finished difference Result 793 states and 1000 transitions. [2025-03-04 11:26:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:26:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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 33 [2025-03-04 11:26:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:46,376 INFO L225 Difference]: With dead ends: 793 [2025-03-04 11:26:46,376 INFO L226 Difference]: Without dead ends: 792 [2025-03-04 11:26:46,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:26:46,377 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:46,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 173 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-04 11:26:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 685. [2025-03-04 11:26:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 534 states have (on average 1.1704119850187267) internal successors, (625), 555 states have internal predecessors, (625), 101 states have call successors, (101), 43 states have call predecessors, (101), 46 states have return successors, (106), 86 states have call predecessors, (106), 78 states have call successors, (106) [2025-03-04 11:26:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 832 transitions. [2025-03-04 11:26:46,429 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 832 transitions. Word has length 33 [2025-03-04 11:26:46,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:46,429 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 832 transitions. [2025-03-04 11:26:46,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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-03-04 11:26:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 832 transitions. [2025-03-04 11:26:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:26:46,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:46,430 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-03-04 11:26:46,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:26:46,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:46,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:46,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 268962918, now seen corresponding path program 1 times [2025-03-04 11:26:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916518288] [2025-03-04 11:26:46,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:46,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:26:46,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:26:46,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:46,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916518288] [2025-03-04 11:26:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916518288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930404339] [2025-03-04 11:26:46,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:46,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:46,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:46,729 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:46,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:26:46,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:26:46,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:26:46,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:46,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:46,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:26:46,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:46,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:46,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930404339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:46,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:46,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 11:26:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259799368] [2025-03-04 11:26:46,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:46,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:26:46,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:46,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:26:46,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:26:46,944 INFO L87 Difference]: Start difference. First operand 685 states and 832 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-03-04 11:26:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:47,365 INFO L93 Difference]: Finished difference Result 1135 states and 1689 transitions. [2025-03-04 11:26:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:26:47,365 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-03-04 11:26:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:47,372 INFO L225 Difference]: With dead ends: 1135 [2025-03-04 11:26:47,372 INFO L226 Difference]: Without dead ends: 1134 [2025-03-04 11:26:47,373 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-03-04 11:26:47,374 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 92 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:47,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 223 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-03-04 11:26:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 945. [2025-03-04 11:26:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 705 states have (on average 1.1602836879432623) internal successors, (818), 740 states have internal predecessors, (818), 150 states have call successors, (150), 50 states have call predecessors, (150), 86 states have return successors, (301), 154 states have call predecessors, (301), 126 states have call successors, (301) [2025-03-04 11:26:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1269 transitions. [2025-03-04 11:26:47,464 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1269 transitions. Word has length 34 [2025-03-04 11:26:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:47,464 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1269 transitions. [2025-03-04 11:26:47,464 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-03-04 11:26:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1269 transitions. [2025-03-04 11:26:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:26:47,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:47,465 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:47,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:47,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:47,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:47,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash -54654743, now seen corresponding path program 1 times [2025-03-04 11:26:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533106807] [2025-03-04 11:26:47,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:47,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:26:47,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:26:47,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:47,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:26:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:47,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533106807] [2025-03-04 11:26:47,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533106807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:47,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651048996] [2025-03-04 11:26:47,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:47,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:47,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:47,738 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:47,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:26:47,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:26:47,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:26:47,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:47,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:47,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:26:47,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:26:47,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:26:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651048996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:47,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:47,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 11:26:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640167193] [2025-03-04 11:26:47,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:47,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:26:47,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:47,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:26:47,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:26:47,937 INFO L87 Difference]: Start difference. First operand 945 states and 1269 transitions. Second operand has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:26:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:48,331 INFO L93 Difference]: Finished difference Result 1154 states and 1562 transitions. [2025-03-04 11:26:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:26:48,332 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-04 11:26:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:48,336 INFO L225 Difference]: With dead ends: 1154 [2025-03-04 11:26:48,336 INFO L226 Difference]: Without dead ends: 1153 [2025-03-04 11:26:48,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:26:48,341 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 221 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:48,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 201 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-04 11:26:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 986. [2025-03-04 11:26:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 739 states have (on average 1.1610284167794316) internal successors, (858), 771 states have internal predecessors, (858), 157 states have call successors, (157), 56 states have call predecessors, (157), 86 states have return successors, (301), 158 states have call predecessors, (301), 126 states have call successors, (301) [2025-03-04 11:26:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1316 transitions. [2025-03-04 11:26:48,418 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1316 transitions. Word has length 35 [2025-03-04 11:26:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:48,418 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1316 transitions. [2025-03-04 11:26:48,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:26:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1316 transitions. [2025-03-04 11:26:48,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:26:48,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:48,420 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-03-04 11:26:48,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:26:48,624 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash 776149949, now seen corresponding path program 1 times [2025-03-04 11:26:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:48,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132058738] [2025-03-04 11:26:48,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:48,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:26:48,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:26:48,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:48,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:48,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132058738] [2025-03-04 11:26:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132058738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239236187] [2025-03-04 11:26:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:48,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:48,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:48,709 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:48,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:26:48,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:26:48,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:26:48,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:48,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:48,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:26:48,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:48,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239236187] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:26:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2025-03-04 11:26:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611415485] [2025-03-04 11:26:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:26:48,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:26:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:48,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:26:48,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:26:48,942 INFO L87 Difference]: Start difference. First operand 986 states and 1316 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-03-04 11:26:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:49,187 INFO L93 Difference]: Finished difference Result 1136 states and 1594 transitions. [2025-03-04 11:26:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:26:49,187 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-03-04 11:26:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:49,193 INFO L225 Difference]: With dead ends: 1136 [2025-03-04 11:26:49,193 INFO L226 Difference]: Without dead ends: 1135 [2025-03-04 11:26:49,194 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-03-04 11:26:49,194 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:49,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 154 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-03-04 11:26:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 994. [2025-03-04 11:26:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 747 states have (on average 1.1552878179384203) internal successors, (863), 775 states have internal predecessors, (863), 161 states have call successors, (161), 56 states have call predecessors, (161), 82 states have return successors, (241), 162 states have call predecessors, (241), 130 states have call successors, (241) [2025-03-04 11:26:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1265 transitions. [2025-03-04 11:26:49,281 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1265 transitions. Word has length 36 [2025-03-04 11:26:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:49,281 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1265 transitions. [2025-03-04 11:26:49,281 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-03-04 11:26:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1265 transitions. [2025-03-04 11:26:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:26:49,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:49,282 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:49,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:49,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:26:49,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:49,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1235994774, now seen corresponding path program 2 times [2025-03-04 11:26:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524013376] [2025-03-04 11:26:49,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:49,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:49,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 11:26:49,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:26:49,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:49,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:49,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:49,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524013376] [2025-03-04 11:26:49,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524013376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:49,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626005414] [2025-03-04 11:26:49,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:49,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:49,600 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:49,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:26:49,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 11:26:49,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:26:49,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:49,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:49,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:26:49,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:49,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:26:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626005414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:49,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 11:26:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830870639] [2025-03-04 11:26:49,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:26:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:49,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:26:49,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:26:49,820 INFO L87 Difference]: Start difference. First operand 994 states and 1265 transitions. Second operand has 24 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 14 states have internal predecessors, (73), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:26:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:50,353 INFO L93 Difference]: Finished difference Result 1989 states and 2570 transitions. [2025-03-04 11:26:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:26:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 14 states have internal predecessors, (73), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-04 11:26:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:50,360 INFO L225 Difference]: With dead ends: 1989 [2025-03-04 11:26:50,360 INFO L226 Difference]: Without dead ends: 1988 [2025-03-04 11:26:50,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 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-03-04 11:26:50,361 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 516 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:50,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 355 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:26:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2025-03-04 11:26:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1709. [2025-03-04 11:26:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1282 states have (on average 1.1365054602184088) internal successors, (1457), 1336 states have internal predecessors, (1457), 269 states have call successors, (269), 90 states have call predecessors, (269), 154 states have return successors, (409), 282 states have call predecessors, (409), 226 states have call successors, (409) [2025-03-04 11:26:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2135 transitions. [2025-03-04 11:26:50,482 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2135 transitions. Word has length 43 [2025-03-04 11:26:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:50,483 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2135 transitions. [2025-03-04 11:26:50,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 14 states have internal predecessors, (73), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:26:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2135 transitions. [2025-03-04 11:26:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:26:50,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:50,485 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-03-04 11:26:50,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:50,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:26:50,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:50,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1489943149, now seen corresponding path program 2 times [2025-03-04 11:26:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:50,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014846908] [2025-03-04 11:26:50,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:50,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 11:26:50,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:26:50,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:50,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014846908] [2025-03-04 11:26:50,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014846908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709806010] [2025-03-04 11:26:50,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:50,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:50,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:50,811 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:50,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:26:50,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 11:26:50,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:26:50,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:50,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:50,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:26:50,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:50,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:26:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709806010] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:51,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:51,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-04 11:26:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603803765] [2025-03-04 11:26:51,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:51,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:26:51,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:51,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:26:51,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:26:51,081 INFO L87 Difference]: Start difference. First operand 1709 states and 2135 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-03-04 11:26:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:51,884 INFO L93 Difference]: Finished difference Result 3697 states and 5359 transitions. [2025-03-04 11:26:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 11:26:51,884 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-03-04 11:26:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:51,894 INFO L225 Difference]: With dead ends: 3697 [2025-03-04 11:26:51,894 INFO L226 Difference]: Without dead ends: 2573 [2025-03-04 11:26:51,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=2049, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 11:26:51,901 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 189 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:51,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 295 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:26:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2025-03-04 11:26:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1888. [2025-03-04 11:26:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1419 states have (on average 1.1310782241014798) internal successors, (1605), 1479 states have internal predecessors, (1605), 293 states have call successors, (293), 104 states have call predecessors, (293), 172 states have return successors, (443), 304 states have call predecessors, (443), 245 states have call successors, (443) [2025-03-04 11:26:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2341 transitions. [2025-03-04 11:26:52,052 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2341 transitions. Word has length 44 [2025-03-04 11:26:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:52,052 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2341 transitions. [2025-03-04 11:26:52,053 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-03-04 11:26:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2341 transitions. [2025-03-04 11:26:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:26:52,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:52,055 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-03-04 11:26:52,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:26:52,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:26:52,256 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:52,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:52,256 INFO L85 PathProgramCache]: Analyzing trace with hash -460172098, now seen corresponding path program 1 times [2025-03-04 11:26:52,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41732086] [2025-03-04 11:26:52,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:52,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:26:52,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:26:52,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:52,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 11:26:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41732086] [2025-03-04 11:26:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41732086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520546197] [2025-03-04 11:26:52,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:52,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:52,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:52,334 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:52,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:26:52,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:26:52,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:26:52,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:52,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:52,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:26:52,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:26:52,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:26:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520546197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:52,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:52,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2025-03-04 11:26:52,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123185480] [2025-03-04 11:26:52,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:52,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:26:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:52,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:26:52,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:26:52,474 INFO L87 Difference]: Start difference. First operand 1888 states and 2341 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:26:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:52,780 INFO L93 Difference]: Finished difference Result 2110 states and 2763 transitions. [2025-03-04 11:26:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:26:52,781 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-03-04 11:26:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:52,788 INFO L225 Difference]: With dead ends: 2110 [2025-03-04 11:26:52,788 INFO L226 Difference]: Without dead ends: 2010 [2025-03-04 11:26:52,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:26:52,789 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 73 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:52,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 127 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:26:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2025-03-04 11:26:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1894. [2025-03-04 11:26:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1425 states have (on average 1.1298245614035087) internal successors, (1610), 1483 states have internal predecessors, (1610), 293 states have call successors, (293), 106 states have call predecessors, (293), 172 states have return successors, (443), 304 states have call predecessors, (443), 245 states have call successors, (443) [2025-03-04 11:26:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2346 transitions. [2025-03-04 11:26:52,929 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2346 transitions. Word has length 51 [2025-03-04 11:26:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:52,929 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2346 transitions. [2025-03-04 11:26:52,929 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, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:26:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2346 transitions. [2025-03-04 11:26:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:26:52,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:52,931 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:52,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:53,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:26:53,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:53,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -682664631, now seen corresponding path program 2 times [2025-03-04 11:26:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:53,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654279503] [2025-03-04 11:26:53,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:53,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 11:26:53,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:26:53,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:53,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 3 proven. 71 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:26:53,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:53,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654279503] [2025-03-04 11:26:53,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654279503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:53,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192761944] [2025-03-04 11:26:53,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:26:53,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:53,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:53,268 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:53,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:26:53,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 11:26:53,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:26:53,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:26:53,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:53,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:26:53,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 3 proven. 71 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:26:53,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 5 proven. 69 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:26:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192761944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:53,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 11:26:53,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757513062] [2025-03-04 11:26:53,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:26:53,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:53,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:26:53,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:26:53,570 INFO L87 Difference]: Start difference. First operand 1894 states and 2346 transitions. Second operand has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:26:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:54,242 INFO L93 Difference]: Finished difference Result 2409 states and 3101 transitions. [2025-03-04 11:26:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 11:26:54,243 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-03-04 11:26:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:54,250 INFO L225 Difference]: With dead ends: 2409 [2025-03-04 11:26:54,250 INFO L226 Difference]: Without dead ends: 2408 [2025-03-04 11:26:54,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=513, Invalid=1937, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:26:54,251 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 435 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:54,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 297 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-03-04 11:26:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1937. [2025-03-04 11:26:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1459 states have (on average 1.1309115832762167) internal successors, (1650), 1515 states have internal predecessors, (1650), 302 states have call successors, (302), 111 states have call predecessors, (302), 172 states have return successors, (443), 310 states have call predecessors, (443), 245 states have call successors, (443) [2025-03-04 11:26:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2395 transitions. [2025-03-04 11:26:54,416 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2395 transitions. Word has length 51 [2025-03-04 11:26:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:54,416 INFO L471 AbstractCegarLoop]: Abstraction has 1937 states and 2395 transitions. [2025-03-04 11:26:54,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 18 states have internal predecessors, (71), 10 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:26:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2395 transitions. [2025-03-04 11:26:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 11:26:54,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:54,419 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-03-04 11:26:54,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:54,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:26:54,623 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:54,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:54,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1951011931, now seen corresponding path program 1 times [2025-03-04 11:26:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204216029] [2025-03-04 11:26:54,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:54,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:26:54,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:26:54,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:54,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:26:54,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:54,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204216029] [2025-03-04 11:26:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204216029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:54,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452649876] [2025-03-04 11:26:54,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:54,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:54,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:54,745 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:54,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:26:54,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:26:54,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:26:54,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:54,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:54,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:26:54,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 11:26:54,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:26:55,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452649876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:55,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:55,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2025-03-04 11:26:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289899107] [2025-03-04 11:26:55,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:55,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:26:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:55,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:26:55,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:26:55,185 INFO L87 Difference]: Start difference. First operand 1937 states and 2395 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-03-04 11:26:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:56,929 INFO L93 Difference]: Finished difference Result 4673 states and 8176 transitions. [2025-03-04 11:26:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-04 11:26:56,929 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-03-04 11:26:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:56,950 INFO L225 Difference]: With dead ends: 4673 [2025-03-04 11:26:56,951 INFO L226 Difference]: Without dead ends: 4672 [2025-03-04 11:26:56,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1475, Invalid=7081, Unknown=0, NotChecked=0, Total=8556 [2025-03-04 11:26:56,955 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 187 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:56,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 246 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:26:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2025-03-04 11:26:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 3296. [2025-03-04 11:26:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 2306 states have (on average 1.1019080659150042) internal successors, (2541), 2372 states have internal predecessors, (2541), 581 states have call successors, (581), 125 states have call predecessors, (581), 405 states have return successors, (2934), 798 states have call predecessors, (2934), 522 states have call successors, (2934) [2025-03-04 11:26:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 6056 transitions. [2025-03-04 11:26:57,342 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 6056 transitions. Word has length 53 [2025-03-04 11:26:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:26:57,343 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 6056 transitions. [2025-03-04 11:26:57,343 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-03-04 11:26:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 6056 transitions. [2025-03-04 11:26:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:26:57,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:26:57,345 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 11:26:57,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:26:57,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:57,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:26:57,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:26:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1491656896, now seen corresponding path program 1 times [2025-03-04 11:26:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:26:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572009203] [2025-03-04 11:26:57,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:26:57,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:26:57,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:26:57,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:57,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:26:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:26:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572009203] [2025-03-04 11:26:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572009203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:26:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128442169] [2025-03-04 11:26:57,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:26:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:26:57,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:26:57,665 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:26:57,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:26:57,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:26:57,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:26:57,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:26:57,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:26:57,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:26:57,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:26:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:26:57,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:26:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:26:57,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128442169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:26:57,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:26:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 11:26:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126872879] [2025-03-04 11:26:57,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:26:57,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:26:57,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:26:57,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:26:57,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:26:57,895 INFO L87 Difference]: Start difference. First operand 3296 states and 6056 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-03-04 11:26:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:26:59,083 INFO L93 Difference]: Finished difference Result 8935 states and 16870 transitions. [2025-03-04 11:26:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:26:59,084 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-03-04 11:26:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:26:59,128 INFO L225 Difference]: With dead ends: 8935 [2025-03-04 11:26:59,128 INFO L226 Difference]: Without dead ends: 8933 [2025-03-04 11:26:59,133 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-03-04 11:26:59,133 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 456 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:26:59,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 341 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:26:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8933 states. [2025-03-04 11:26:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8933 to 8720. [2025-03-04 11:27:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8720 states, 6122 states have (on average 1.0991506043776544) internal successors, (6729), 6296 states have internal predecessors, (6729), 1535 states have call successors, (1535), 341 states have call predecessors, (1535), 1059 states have return successors, (7710), 2082 states have call predecessors, (7710), 1368 states have call successors, (7710) [2025-03-04 11:27:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8720 states to 8720 states and 15974 transitions. [2025-03-04 11:27:00,038 INFO L78 Accepts]: Start accepts. Automaton has 8720 states and 15974 transitions. Word has length 57 [2025-03-04 11:27:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 8720 states and 15974 transitions. [2025-03-04 11:27:00,039 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-03-04 11:27:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8720 states and 15974 transitions. [2025-03-04 11:27:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:27:00,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:00,040 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-03-04 11:27:00,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:27:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:00,245 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:00,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1977419150, now seen corresponding path program 1 times [2025-03-04 11:27:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491941255] [2025-03-04 11:27:00,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:00,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:27:00,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:27:00,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:00,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:27:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491941255] [2025-03-04 11:27:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491941255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718613902] [2025-03-04 11:27:00,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:27:00,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:00,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:00,351 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:00,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:27:00,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:27:00,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:27:00,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:27:00,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:00,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:27:00,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 11:27:00,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:27:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718613902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:00,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:00,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2025-03-04 11:27:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839895944] [2025-03-04 11:27:00,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:00,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:27:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:00,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:27:00,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:27:00,770 INFO L87 Difference]: Start difference. First operand 8720 states and 15974 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-03-04 11:27:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:05,167 INFO L93 Difference]: Finished difference Result 37045 states and 112394 transitions. [2025-03-04 11:27:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-04 11:27:05,168 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-03-04 11:27:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:05,376 INFO L225 Difference]: With dead ends: 37045 [2025-03-04 11:27:05,376 INFO L226 Difference]: Without dead ends: 28996 [2025-03-04 11:27:05,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1752, Invalid=7560, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 11:27:05,481 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 172 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:05,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 354 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:27:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28996 states. [2025-03-04 11:27:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28996 to 20092. [2025-03-04 11:27:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20092 states, 13074 states have (on average 1.0577482025393912) internal successors, (13829), 13284 states have internal predecessors, (13829), 4021 states have call successors, (4021), 427 states have call predecessors, (4021), 2993 states have return successors, (45035), 6380 states have call predecessors, (45035), 3840 states have call successors, (45035) [2025-03-04 11:27:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20092 states to 20092 states and 62885 transitions. [2025-03-04 11:27:08,771 INFO L78 Accepts]: Start accepts. Automaton has 20092 states and 62885 transitions. Word has length 55 [2025-03-04 11:27:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:08,771 INFO L471 AbstractCegarLoop]: Abstraction has 20092 states and 62885 transitions. [2025-03-04 11:27:08,772 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-03-04 11:27:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20092 states and 62885 transitions. [2025-03-04 11:27:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:27:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:08,775 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:08,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:27:08,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:08,976 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:08,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1779584020, now seen corresponding path program 2 times [2025-03-04 11:27:08,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:08,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655456588] [2025-03-04 11:27:08,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:08,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 11:27:08,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:27:08,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:08,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 67 proven. 19 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 11:27:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655456588] [2025-03-04 11:27:09,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655456588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072738030] [2025-03-04 11:27:09,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:09,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:09,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:09,177 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:09,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:27:09,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 11:27:09,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:27:09,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:09,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:27:09,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 11:27:09,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 78 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 11:27:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072738030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:09,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 31 [2025-03-04 11:27:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036262951] [2025-03-04 11:27:09,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:27:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:09,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:27:09,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:27:09,898 INFO L87 Difference]: Start difference. First operand 20092 states and 62885 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-03-04 11:27:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:13,089 INFO L93 Difference]: Finished difference Result 34821 states and 105928 transitions. [2025-03-04 11:27:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 11:27:13,090 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 72 [2025-03-04 11:27:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:13,174 INFO L225 Difference]: With dead ends: 34821 [2025-03-04 11:27:13,174 INFO L226 Difference]: Without dead ends: 15389 [2025-03-04 11:27:13,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1108, Invalid=5212, Unknown=0, NotChecked=0, Total=6320 [2025-03-04 11:27:13,427 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 183 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:13,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 488 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:27:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15389 states. [2025-03-04 11:27:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15389 to 12581. [2025-03-04 11:27:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12581 states, 8648 states have (on average 1.0882284921369103) internal successors, (9411), 9009 states have internal predecessors, (9411), 2410 states have call successors, (2410), 459 states have call predecessors, (2410), 1519 states have return successors, (6313), 3112 states have call predecessors, (6313), 2233 states have call successors, (6313) [2025-03-04 11:27:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12581 states to 12581 states and 18134 transitions. [2025-03-04 11:27:15,086 INFO L78 Accepts]: Start accepts. Automaton has 12581 states and 18134 transitions. Word has length 72 [2025-03-04 11:27:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:15,086 INFO L471 AbstractCegarLoop]: Abstraction has 12581 states and 18134 transitions. [2025-03-04 11:27:15,086 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-03-04 11:27:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 12581 states and 18134 transitions. [2025-03-04 11:27:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:27:15,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:15,089 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:15,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:27:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:15,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash 173863337, now seen corresponding path program 3 times [2025-03-04 11:27:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834854160] [2025-03-04 11:27:15,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:15,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 7 equivalence classes. [2025-03-04 11:27:15,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 59 of 67 statements. [2025-03-04 11:27:15,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:27:15,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 11:27:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834854160] [2025-03-04 11:27:15,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834854160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:27:15,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:27:15,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:27:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378715327] [2025-03-04 11:27:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:27:15,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:27:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:15,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:27:15,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:27:15,350 INFO L87 Difference]: Start difference. First operand 12581 states and 18134 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-03-04 11:27:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:16,473 INFO L93 Difference]: Finished difference Result 12681 states and 19705 transitions. [2025-03-04 11:27:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:27:16,473 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 67 [2025-03-04 11:27:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:16,523 INFO L225 Difference]: With dead ends: 12681 [2025-03-04 11:27:16,523 INFO L226 Difference]: Without dead ends: 10670 [2025-03-04 11:27:16,533 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-03-04 11:27:16,534 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:16,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10670 states. [2025-03-04 11:27:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10670 to 10486. [2025-03-04 11:27:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10486 states, 6985 states have (on average 1.0564065855404439) internal successors, (7379), 7108 states have internal predecessors, (7379), 2240 states have call successors, (2240), 331 states have call predecessors, (2240), 1258 states have return successors, (5982), 3046 states have call predecessors, (5982), 2233 states have call successors, (5982) [2025-03-04 11:27:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10486 states to 10486 states and 15601 transitions. [2025-03-04 11:27:17,952 INFO L78 Accepts]: Start accepts. Automaton has 10486 states and 15601 transitions. Word has length 67 [2025-03-04 11:27:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:17,952 INFO L471 AbstractCegarLoop]: Abstraction has 10486 states and 15601 transitions. [2025-03-04 11:27:17,952 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-03-04 11:27:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10486 states and 15601 transitions. [2025-03-04 11:27:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:27:17,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:17,955 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 11:27:17,955 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1635289475, now seen corresponding path program 3 times [2025-03-04 11:27:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403569345] [2025-03-04 11:27:17,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:17,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 8 equivalence classes. [2025-03-04 11:27:17,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:27:17,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 11:27:17,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 41 proven. 46 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 11:27:18,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:18,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403569345] [2025-03-04 11:27:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403569345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:18,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167934071] [2025-03-04 11:27:18,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:18,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:18,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:18,149 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:18,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:27:18,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 8 equivalence classes. [2025-03-04 11:27:18,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:27:18,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 11:27:18,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:18,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:27:18,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 79 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:27:18,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 75 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:27:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167934071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:18,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2025-03-04 11:27:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420668953] [2025-03-04 11:27:18,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:18,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 11:27:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:18,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 11:27:18,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 11:27:18,821 INFO L87 Difference]: Start difference. First operand 10486 states and 15601 transitions. Second operand has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 29 states have internal predecessors, (132), 16 states have call successors, (18), 13 states have call predecessors, (18), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:27:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:21,802 INFO L93 Difference]: Finished difference Result 20433 states and 35844 transitions. [2025-03-04 11:27:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 11:27:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 29 states have internal predecessors, (132), 16 states have call successors, (18), 13 states have call predecessors, (18), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2025-03-04 11:27:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:21,858 INFO L225 Difference]: With dead ends: 20433 [2025-03-04 11:27:21,858 INFO L226 Difference]: Without dead ends: 10519 [2025-03-04 11:27:21,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=952, Invalid=4598, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 11:27:21,919 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 289 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:21,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 216 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:27:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10519 states. [2025-03-04 11:27:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10519 to 10235. [2025-03-04 11:27:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10235 states, 6682 states have (on average 1.0428015564202335) internal successors, (6968), 6813 states have internal predecessors, (6968), 2128 states have call successors, (2128), 279 states have call predecessors, (2128), 1423 states have return successors, (5603), 3142 states have call predecessors, (5603), 2122 states have call successors, (5603) [2025-03-04 11:27:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 14699 transitions. [2025-03-04 11:27:23,299 INFO L78 Accepts]: Start accepts. Automaton has 10235 states and 14699 transitions. Word has length 68 [2025-03-04 11:27:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 10235 states and 14699 transitions. [2025-03-04 11:27:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 29 states have internal predecessors, (132), 16 states have call successors, (18), 13 states have call predecessors, (18), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:27:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10235 states and 14699 transitions. [2025-03-04 11:27:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 11:27:23,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:23,301 INFO L218 NwaCegarLoop]: trace histogram [12, 8, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:23,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:27:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:23,502 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1272830796, now seen corresponding path program 2 times [2025-03-04 11:27:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780157317] [2025-03-04 11:27:23,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:23,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-04 11:27:23,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 11:27:23,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 132 proven. 31 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-04 11:27:23,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:23,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780157317] [2025-03-04 11:27:23,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780157317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:23,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166024001] [2025-03-04 11:27:23,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:27:23,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:23,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:23,583 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:23,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:27:23,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-04 11:27:23,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 11:27:23,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:27:23,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:23,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:27:23,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 15 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 11:27:23,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 26 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-04 11:27:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166024001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:23,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 11 [2025-03-04 11:27:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204848812] [2025-03-04 11:27:23,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:23,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:27:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:23,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:27:23,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:27:23,941 INFO L87 Difference]: Start difference. First operand 10235 states and 14699 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 11:27:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:25,542 INFO L93 Difference]: Finished difference Result 22118 states and 33837 transitions. [2025-03-04 11:27:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:27:25,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) Word has length 105 [2025-03-04 11:27:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:25,596 INFO L225 Difference]: With dead ends: 22118 [2025-03-04 11:27:25,596 INFO L226 Difference]: Without dead ends: 12286 [2025-03-04 11:27:25,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:27:25,648 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:25,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 88 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:27:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12286 states. [2025-03-04 11:27:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12286 to 10000. [2025-03-04 11:27:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10000 states, 6542 states have (on average 1.043717517578722) internal successors, (6828), 6673 states have internal predecessors, (6828), 2078 states have call successors, (2078), 279 states have call predecessors, (2078), 1378 states have return successors, (5412), 3047 states have call predecessors, (5412), 2045 states have call successors, (5412) [2025-03-04 11:27:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10000 states to 10000 states and 14318 transitions. [2025-03-04 11:27:27,066 INFO L78 Accepts]: Start accepts. Automaton has 10000 states and 14318 transitions. Word has length 105 [2025-03-04 11:27:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:27,067 INFO L471 AbstractCegarLoop]: Abstraction has 10000 states and 14318 transitions. [2025-03-04 11:27:27,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 11:27:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10000 states and 14318 transitions. [2025-03-04 11:27:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:27:27,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:27,069 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:27,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:27:27,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:27,270 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:27,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash -456104179, now seen corresponding path program 3 times [2025-03-04 11:27:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:27,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273539475] [2025-03-04 11:27:27,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:27,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:27,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 7 equivalence classes. [2025-03-04 11:27:27,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 86 of 100 statements. [2025-03-04 11:27:27,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:27:27,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 127 proven. 43 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 11:27:27,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273539475] [2025-03-04 11:27:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273539475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:27,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703403558] [2025-03-04 11:27:27,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:27,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:27,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:27,359 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:27,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:27:27,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 7 equivalence classes. [2025-03-04 11:27:27,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 86 of 100 statements. [2025-03-04 11:27:27,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:27:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:27,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:27:27,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 153 proven. 26 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-04 11:27:27,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 123 proven. 57 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 11:27:28,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703403558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:28,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:28,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 15 [2025-03-04 11:27:28,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542324807] [2025-03-04 11:27:28,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:28,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:27:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:28,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:27:28,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:27:28,040 INFO L87 Difference]: Start difference. First operand 10000 states and 14318 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (13), 4 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:27:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:29,429 INFO L93 Difference]: Finished difference Result 20552 states and 34945 transitions. [2025-03-04 11:27:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:27:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (13), 4 states have call predecessors, (13), 7 states have call successors, (13) Word has length 100 [2025-03-04 11:27:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:29,494 INFO L225 Difference]: With dead ends: 20552 [2025-03-04 11:27:29,494 INFO L226 Difference]: Without dead ends: 11109 [2025-03-04 11:27:29,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 195 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:27:29,550 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 66 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:29,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 147 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:27:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2025-03-04 11:27:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 6185. [2025-03-04 11:27:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6185 states, 4146 states have (on average 1.0381090207428847) internal successors, (4304), 4258 states have internal predecessors, (4304), 1225 states have call successors, (1225), 214 states have call predecessors, (1225), 812 states have return successors, (2059), 1712 states have call predecessors, (2059), 1203 states have call successors, (2059) [2025-03-04 11:27:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 7588 transitions. [2025-03-04 11:27:30,592 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 7588 transitions. Word has length 100 [2025-03-04 11:27:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:30,593 INFO L471 AbstractCegarLoop]: Abstraction has 6185 states and 7588 transitions. [2025-03-04 11:27:30,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 7 states have call successors, (11), 2 states have call predecessors, (11), 7 states have return successors, (13), 4 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-04 11:27:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 7588 transitions. [2025-03-04 11:27:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 11:27:30,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:30,595 INFO L218 NwaCegarLoop]: trace histogram [12, 10, 8, 8, 8, 7, 7, 7, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:30,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:30,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 11:27:30,796 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:30,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1767133044, now seen corresponding path program 3 times [2025-03-04 11:27:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974103428] [2025-03-04 11:27:30,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:30,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 10 equivalence classes. [2025-03-04 11:27:30,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:27:30,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 11:27:30,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 179 proven. 91 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 11:27:31,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974103428] [2025-03-04 11:27:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974103428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211924617] [2025-03-04 11:27:31,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:31,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:31,156 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:31,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 11:27:31,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 10 equivalence classes. [2025-03-04 11:27:31,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:27:31,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 11:27:31,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:31,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:27:31,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 171 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:27:31,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 191 proven. 79 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 11:27:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211924617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:32,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22] total 43 [2025-03-04 11:27:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925648382] [2025-03-04 11:27:32,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:32,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 11:27:32,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:32,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 11:27:32,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 11:27:32,142 INFO L87 Difference]: Start difference. First operand 6185 states and 7588 transitions. Second operand has 44 states, 43 states have (on average 2.697674418604651) internal successors, (116), 28 states have internal predecessors, (116), 13 states have call successors, (15), 11 states have call predecessors, (15), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 11:27:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:33,813 INFO L93 Difference]: Finished difference Result 11662 states and 14984 transitions. [2025-03-04 11:27:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:27:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.697674418604651) internal successors, (116), 28 states have internal predecessors, (116), 13 states have call successors, (15), 11 states have call predecessors, (15), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-03-04 11:27:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:33,843 INFO L225 Difference]: With dead ends: 11662 [2025-03-04 11:27:33,843 INFO L226 Difference]: Without dead ends: 6110 [2025-03-04 11:27:33,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1344, Invalid=5628, Unknown=0, NotChecked=0, Total=6972 [2025-03-04 11:27:33,862 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 181 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:33,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 453 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:27:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2025-03-04 11:27:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6028. [2025-03-04 11:27:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6028 states, 4059 states have (on average 1.0344912540034492) internal successors, (4199), 4171 states have internal predecessors, (4199), 1172 states have call successors, (1172), 214 states have call predecessors, (1172), 795 states have return successors, (1953), 1642 states have call predecessors, (1953), 1150 states have call successors, (1953) [2025-03-04 11:27:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 7324 transitions. [2025-03-04 11:27:34,736 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 7324 transitions. Word has length 104 [2025-03-04 11:27:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:34,737 INFO L471 AbstractCegarLoop]: Abstraction has 6028 states and 7324 transitions. [2025-03-04 11:27:34,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.697674418604651) internal successors, (116), 28 states have internal predecessors, (116), 13 states have call successors, (15), 11 states have call predecessors, (15), 8 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 11:27:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 7324 transitions. [2025-03-04 11:27:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:27:34,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:34,742 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:34,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:34,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:27:34,946 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:34,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1997819510, now seen corresponding path program 3 times [2025-03-04 11:27:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206207075] [2025-03-04 11:27:34,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:34,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-03-04 11:27:34,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:27:34,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:27:34,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:27:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206207075] [2025-03-04 11:27:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206207075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987623865] [2025-03-04 11:27:35,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:27:35,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:35,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:35,219 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:35,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 11:27:35,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-03-04 11:27:35,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:27:35,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:27:35,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:35,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:27:35,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:27:35,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:27:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987623865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:35,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 11:27:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460417954] [2025-03-04 11:27:35,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:35,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 11:27:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:35,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 11:27:35,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:27:35,853 INFO L87 Difference]: Start difference. First operand 6028 states and 7324 transitions. Second operand has 48 states, 45 states have (on average 3.488888888888889) internal successors, (157), 26 states have internal predecessors, (157), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:27:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:38,047 INFO L93 Difference]: Finished difference Result 10945 states and 13321 transitions. [2025-03-04 11:27:38,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 11:27:38,048 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 3.488888888888889) internal successors, (157), 26 states have internal predecessors, (157), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-04 11:27:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:38,092 INFO L225 Difference]: With dead ends: 10945 [2025-03-04 11:27:38,092 INFO L226 Difference]: Without dead ends: 10944 [2025-03-04 11:27:38,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 11:27:38,098 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 900 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:38,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 605 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:27:38,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2025-03-04 11:27:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 10900. [2025-03-04 11:27:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10900 states, 7275 states have (on average 1.0357388316151204) internal successors, (7535), 7495 states have internal predecessors, (7535), 2120 states have call successors, (2120), 334 states have call predecessors, (2120), 1503 states have return successors, (3609), 3070 states have call predecessors, (3609), 2098 states have call successors, (3609) [2025-03-04 11:27:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10900 states to 10900 states and 13264 transitions. [2025-03-04 11:27:39,578 INFO L78 Accepts]: Start accepts. Automaton has 10900 states and 13264 transitions. Word has length 91 [2025-03-04 11:27:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:39,578 INFO L471 AbstractCegarLoop]: Abstraction has 10900 states and 13264 transitions. [2025-03-04 11:27:39,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 3.488888888888889) internal successors, (157), 26 states have internal predecessors, (157), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:27:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 10900 states and 13264 transitions. [2025-03-04 11:27:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:27:39,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:39,581 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:39,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 11:27:39,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 11:27:39,785 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:39,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2745563, now seen corresponding path program 4 times [2025-03-04 11:27:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010370111] [2025-03-04 11:27:39,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:27:39,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:39,789 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-04 11:27:39,796 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:27:39,797 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:27:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 43 proven. 71 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 11:27:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010370111] [2025-03-04 11:27:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010370111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192649168] [2025-03-04 11:27:40,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:27:40,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:40,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:40,098 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:40,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 11:27:40,154 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-03-04 11:27:40,172 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:27:40,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:27:40,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:40,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:27:40,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 11:27:40,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:27:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-04 11:27:41,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192649168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:27:41,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:27:41,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 23] total 40 [2025-03-04 11:27:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659181270] [2025-03-04 11:27:41,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:27:41,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-04 11:27:41,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:27:41,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-04 11:27:41,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:27:41,601 INFO L87 Difference]: Start difference. First operand 10900 states and 13264 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 31 states have internal predecessors, (75), 9 states have call successors, (11), 3 states have call predecessors, (11), 13 states have return successors, (16), 16 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 11:27:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:27:48,267 INFO L93 Difference]: Finished difference Result 40082 states and 58409 transitions. [2025-03-04 11:27:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-04 11:27:48,268 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 31 states have internal predecessors, (75), 9 states have call successors, (11), 3 states have call predecessors, (11), 13 states have return successors, (16), 16 states have call predecessors, (16), 7 states have call successors, (16) Word has length 91 [2025-03-04 11:27:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:27:48,406 INFO L225 Difference]: With dead ends: 40082 [2025-03-04 11:27:48,406 INFO L226 Difference]: Without dead ends: 38981 [2025-03-04 11:27:48,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8895 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4423, Invalid=22637, Unknown=0, NotChecked=0, Total=27060 [2025-03-04 11:27:48,431 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 214 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:27:48,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 342 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:27:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38981 states. [2025-03-04 11:27:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38981 to 18407. [2025-03-04 11:27:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18407 states, 11855 states have (on average 1.023281315900464) internal successors, (12131), 12065 states have internal predecessors, (12131), 3710 states have call successors, (3710), 395 states have call predecessors, (3710), 2840 states have return successors, (7522), 5946 states have call predecessors, (7522), 3679 states have call successors, (7522) [2025-03-04 11:27:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18407 states to 18407 states and 23363 transitions. [2025-03-04 11:27:51,783 INFO L78 Accepts]: Start accepts. Automaton has 18407 states and 23363 transitions. Word has length 91 [2025-03-04 11:27:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:27:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 18407 states and 23363 transitions. [2025-03-04 11:27:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 31 states have internal predecessors, (75), 9 states have call successors, (11), 3 states have call predecessors, (11), 13 states have return successors, (16), 16 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 11:27:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18407 states and 23363 transitions. [2025-03-04 11:27:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 11:27:51,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:27:51,795 INFO L218 NwaCegarLoop]: trace histogram [18, 16, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:27:51,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 11:27:51,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:51,999 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:27:51,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:27:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1870843355, now seen corresponding path program 5 times [2025-03-04 11:27:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:27:51,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947654772] [2025-03-04 11:27:51,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:27:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:27:52,005 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 167 statements into 13 equivalence classes. [2025-03-04 11:27:52,024 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:27:52,024 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-04 11:27:52,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 134 proven. 297 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-04 11:27:52,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:27:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947654772] [2025-03-04 11:27:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947654772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:27:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041724577] [2025-03-04 11:27:52,710 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:27:52,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:27:52,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:27:52,712 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:27:52,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 11:27:52,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 167 statements into 13 equivalence classes. [2025-03-04 11:27:52,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:27:52,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-04 11:27:52,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:27:52,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 11:27:52,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:27:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 98 proven. 285 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-04 11:27:52,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 114 proven. 409 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-03-04 11:28:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041724577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:00,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:00,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 43] total 72 [2025-03-04 11:28:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932952386] [2025-03-04 11:28:00,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:00,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-04 11:28:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:00,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-04 11:28:00,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=4646, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 11:28:00,532 INFO L87 Difference]: Start difference. First operand 18407 states and 23363 transitions. Second operand has 73 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 55 states have internal predecessors, (119), 17 states have call successors, (19), 3 states have call predecessors, (19), 25 states have return successors, (32), 32 states have call predecessors, (32), 15 states have call successors, (32)