./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i5_o5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i5_o5-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 019a1f0c8a0db266ae045e6c9616b1be3853f9265d9110ea0f95df9172dad7ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:59:02,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:59:02,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:59:02,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:59:02,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:59:02,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:59:02,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:59:02,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:59:02,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:59:02,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:59:02,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:59:02,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:59:02,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:59:02,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:59:02,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:59:02,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:59:02,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:59:02,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:59:02,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:59:02,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 019a1f0c8a0db266ae045e6c9616b1be3853f9265d9110ea0f95df9172dad7ef [2025-02-05 15:59:02,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:59:02,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:59:02,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:59:02,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:59:02,666 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:59:02,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i5_o5-1.c [2025-02-05 15:59:03,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18c8c8b30/52a9fb657619416f9d3a6b20e9e72dd6/FLAGd4e651a5f [2025-02-05 15:59:04,108 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:59:04,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-1.c [2025-02-05 15:59:04,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18c8c8b30/52a9fb657619416f9d3a6b20e9e72dd6/FLAGd4e651a5f [2025-02-05 15:59:04,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18c8c8b30/52a9fb657619416f9d3a6b20e9e72dd6 [2025-02-05 15:59:04,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:59:04,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:59:04,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:59:04,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:59:04,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:59:04,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582a492e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04, skipping insertion in model container [2025-02-05 15:59:04,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:59:04,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-1.c[450,463] [2025-02-05 15:59:04,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:59:04,293 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:59:04,300 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-1.c[450,463] [2025-02-05 15:59:04,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:59:04,310 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:59:04,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04 WrapperNode [2025-02-05 15:59:04,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:59:04,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:59:04,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:59:04,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:59:04,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,327 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-02-05 15:59:04,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:59:04,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:59:04,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:59:04,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:59:04,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:59:04,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:59:04,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:59:04,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:59:04,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:59:04,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (1/1) ... [2025-02-05 15:59:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:59:04,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:04,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:59:04,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:59:04,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:59:04,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:59:04,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:59:04,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:59:04,397 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-02-05 15:59:04,397 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-02-05 15:59:04,432 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:59:04,433 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:59:04,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-02-05 15:59:04,488 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-05 15:59:04,488 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:59:04,493 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:59:04,494 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:59:04,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:59:04 BoogieIcfgContainer [2025-02-05 15:59:04,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:59:04,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:59:04,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:59:04,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:59:04,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:59:04" (1/3) ... [2025-02-05 15:59:04,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f99f30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:59:04, skipping insertion in model container [2025-02-05 15:59:04,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:59:04" (2/3) ... [2025-02-05 15:59:04,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f99f30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:59:04, skipping insertion in model container [2025-02-05 15:59:04,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:59:04" (3/3) ... [2025-02-05 15:59:04,500 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2025-02-05 15:59:04,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:59:04,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i5_o5-1.c that has 2 procedures, 16 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:59:04,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:59:04,546 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;@57694250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:59:04,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:59:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:59:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:59:04,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:04,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:04,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:04,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1536782931, now seen corresponding path program 1 times [2025-02-05 15:59:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626373437] [2025-02-05 15:59:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:59:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:04,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:59:04,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:59:04,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:59:04,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:59:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:04,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626373437] [2025-02-05 15:59:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626373437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:59:04,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:59:04,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:59:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088152587] [2025-02-05 15:59:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:59:04,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:59:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:04,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:59:04,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:59:04,713 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:59:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:04,737 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-02-05 15:59:04,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:59:04,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-02-05 15:59:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:04,742 INFO L225 Difference]: With dead ends: 25 [2025-02-05 15:59:04,742 INFO L226 Difference]: Without dead ends: 15 [2025-02-05 15:59:04,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:59:04,746 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:04,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:59:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-05 15:59:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-05 15:59:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:59:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-02-05 15:59:04,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2025-02-05 15:59:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:04,770 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-02-05 15:59:04,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:59:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-02-05 15:59:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 15:59:04,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:04,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:04,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:59:04,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:04,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash -808024836, now seen corresponding path program 1 times [2025-02-05 15:59:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321335489] [2025-02-05 15:59:04,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:59:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:04,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 15:59:04,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 15:59:04,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:59:04,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:59:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:04,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321335489] [2025-02-05 15:59:04,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321335489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:04,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809445057] [2025-02-05 15:59:04,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:59:04,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:04,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:04,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:59:04,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:59:04,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 15:59:04,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 15:59:04,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:59:04,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:04,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:59:04,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:59:04,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:59:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809445057] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:05,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-02-05 15:59:05,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560514929] [2025-02-05 15:59:05,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:59:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:05,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:59:05,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:59:05,078 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:59:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:05,113 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-02-05 15:59:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:59:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2025-02-05 15:59:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:05,114 INFO L225 Difference]: With dead ends: 22 [2025-02-05 15:59:05,116 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 15:59:05,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:59:05,118 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:05,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:59:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 15:59:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-05 15:59:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:59:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-02-05 15:59:05,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2025-02-05 15:59:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:05,124 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-02-05 15:59:05,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:59:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-02-05 15:59:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 15:59:05,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:05,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:05,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:59:05,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:05,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:05,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1152729037, now seen corresponding path program 2 times [2025-02-05 15:59:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:05,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75813975] [2025-02-05 15:59:05,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:59:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:05,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-05 15:59:05,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 15:59:05,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:59:05,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:59:05,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75813975] [2025-02-05 15:59:05,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75813975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958373223] [2025-02-05 15:59:05,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:59:05,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:05,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:05,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:59:05,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:59:05,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-05 15:59:05,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 15:59:05,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:59:05,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:05,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:59:05,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:59:05,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:59:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958373223] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:05,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2025-02-05 15:59:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111342203] [2025-02-05 15:59:05,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:05,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 15:59:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:05,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 15:59:05,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:59:05,923 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-05 15:59:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:06,023 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-02-05 15:59:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:59:06,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 22 [2025-02-05 15:59:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:06,024 INFO L225 Difference]: With dead ends: 25 [2025-02-05 15:59:06,024 INFO L226 Difference]: Without dead ends: 21 [2025-02-05 15:59:06,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:59:06,025 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:06,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:59:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-05 15:59:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-05 15:59:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:59:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-02-05 15:59:06,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2025-02-05 15:59:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:06,028 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-02-05 15:59:06,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-05 15:59:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-02-05 15:59:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 15:59:06,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:06,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:06,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:59:06,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:06,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1224835100, now seen corresponding path program 3 times [2025-02-05 15:59:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:06,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977574348] [2025-02-05 15:59:06,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:59:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:06,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-02-05 15:59:06,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 15:59:06,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:59:06,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:59:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:59:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977574348] [2025-02-05 15:59:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977574348] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:59:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694365250] [2025-02-05 15:59:06,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:59:06,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:06,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:59:06,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:59:06,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:59:06,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-02-05 15:59:06,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 15:59:06,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 15:59:06,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:59:06,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:59:06,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:59:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:59:06,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:59:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:59:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694365250] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:59:06,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:59:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 23 [2025-02-05 15:59:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090273100] [2025-02-05 15:59:06,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:59:06,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:59:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:59:06,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:59:06,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:59:06,822 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 15:59:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:59:07,068 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-02-05 15:59:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:59:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) Word has length 28 [2025-02-05 15:59:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:59:07,069 INFO L225 Difference]: With dead ends: 33 [2025-02-05 15:59:07,069 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 15:59:07,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 15:59:07,071 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:59:07,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 78 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:59:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 15:59:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 15:59:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:59:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-02-05 15:59:07,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 28 [2025-02-05 15:59:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:59:07,077 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-02-05 15:59:07,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 15:59:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-02-05 15:59:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 15:59:07,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:59:07,078 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:59:07,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:59:07,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:59:07,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:59:07,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:59:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1162593084, now seen corresponding path program 4 times [2025-02-05 15:59:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:59:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101912278] [2025-02-05 15:59:07,284 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:59:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:59:07,289 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-02-05 15:59:07,297 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:59:07,297 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:59:07,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:59:07,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:59:07,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 15:59:07,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:59:07,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:59:07,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:59:07,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:59:07,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:59:07,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:59:07,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:59:07,322 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-02-05 15:59:07,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:59:07,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:59:07 BoogieIcfgContainer [2025-02-05 15:59:07,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:59:07,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:59:07,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:59:07,338 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:59:07,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:59:04" (3/4) ... [2025-02-05 15:59:07,339 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:59:07,365 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 20. [2025-02-05 15:59:07,409 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:59:07,409 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:59:07,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:59:07,410 INFO L158 Benchmark]: Toolchain (without parser) took 3275.29ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 70.9MB in the end (delta: 61.2MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-02-05 15:59:07,410 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory was 140.7MB in the beginning and 140.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:59:07,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.79ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 121.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:59:07,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.19ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 992.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:59:07,411 INFO L158 Benchmark]: Boogie Preprocessor took 19.72ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 119.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:59:07,411 INFO L158 Benchmark]: IcfgBuilder took 146.16ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 109.7MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:59:07,412 INFO L158 Benchmark]: TraceAbstraction took 2841.68ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 77.3MB in the end (delta: 31.4MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-02-05 15:59:07,412 INFO L158 Benchmark]: Witness Printer took 71.86ms. Allocated memory is still 167.8MB. Free memory was 77.3MB in the beginning and 70.9MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:59:07,413 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory was 140.7MB in the beginning and 140.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.79ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 121.1MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.19ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 992.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.72ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 119.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 146.16ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 109.7MB in the end (delta: 9.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2841.68ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 77.3MB in the end (delta: 31.4MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 71.86ms. Allocated memory is still 167.8MB. Free memory was 77.3MB in the beginning and 70.9MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 5; VAL [input=5] [L13] CALL, EXPR id(input) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=5] [L13] int result = id(input); [L14] COND TRUE result == 5 VAL [input=5] [L15] reach_error() VAL [input=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 45 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 102 SyntacticMatches, 10 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 472 SizeOfPredicates, 3 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 60/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:59:07,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE