./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Fibonacci04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d1a4b1841ad6fa39491d7c82c38d46725a7eceb7c19c007d9e026b8eedadeb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:20,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:21,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:42:21,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:21,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:21,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:21,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:21,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:21,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:21,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:21,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:21,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:21,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:21,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:21,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:21,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:21,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:21,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:21,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:21,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:21,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:21,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:21,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:21,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:21,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:21,038 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 ! 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 -> 8d1a4b1841ad6fa39491d7c82c38d46725a7eceb7c19c007d9e026b8eedadeb5 [2025-03-08 05:42:21,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:21,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:21,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:21,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:21,263 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:21,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2025-03-08 05:42:22,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94cba904/c0b4e8b31128482484b05f1867919c02/FLAG3aa20c412 [2025-03-08 05:42:22,684 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:22,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2025-03-08 05:42:22,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94cba904/c0b4e8b31128482484b05f1867919c02/FLAG3aa20c412 [2025-03-08 05:42:22,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94cba904/c0b4e8b31128482484b05f1867919c02 [2025-03-08 05:42:22,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:22,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:22,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:22,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:22,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:22,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723fbc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22, skipping insertion in model container [2025-03-08 05:42:22,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:22,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[822,835] [2025-03-08 05:42:22,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:22,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:22,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[822,835] [2025-03-08 05:42:22,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:22,862 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:22,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22 WrapperNode [2025-03-08 05:42:22,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:22,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:22,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:22,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:22,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,883 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-03-08 05:42:22,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:22,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:22,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:22,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:22,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,900 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-08 05:42:22,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:22,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:22,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:22,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:22,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (1/1) ... [2025-03-08 05:42:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:22,932 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-08 05:42:22,935 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-08 05:42:22,955 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-08 05:42:22,955 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-08 05:42:22,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:22,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:22,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:22,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:22,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:22,998 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:23,050 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4;havoc #t~ret5; [2025-03-08 05:42:23,086 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:23,086 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:23,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:23,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:23,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:23 BoogieIcfgContainer [2025-03-08 05:42:23,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:23,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:23,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:23,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:23,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:22" (1/3) ... [2025-03-08 05:42:23,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7839b00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:23, skipping insertion in model container [2025-03-08 05:42:23,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:22" (2/3) ... [2025-03-08 05:42:23,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7839b00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:23, skipping insertion in model container [2025-03-08 05:42:23,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:23" (3/3) ... [2025-03-08 05:42:23,098 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2025-03-08 05:42:23,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:23,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci04.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:42:23,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:23,149 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;@4c4f8e32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:23,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:42:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 05:42:23,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:23,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:23,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash 828343037, now seen corresponding path program 1 times [2025-03-08 05:42:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445490760] [2025-03-08 05:42:23,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:23,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:42:23,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:42:23,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:23,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,335 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-08 05:42:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445490760] [2025-03-08 05:42:23,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445490760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:23,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:23,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:23,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470723373] [2025-03-08 05:42:23,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:23,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:23,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:23,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:23,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:23,356 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-03-08 05:42:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:23,439 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-03-08 05:42:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-03-08 05:42:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:23,445 INFO L225 Difference]: With dead ends: 31 [2025-03-08 05:42:23,446 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 05:42:23,449 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-03-08 05:42:23,451 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:23,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 05:42:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-08 05:42:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 05:42:23,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2025-03-08 05:42:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:23,483 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 05:42:23,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-03-08 05:42:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 05:42:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 05:42:23,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:23,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:23,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:23,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:23,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1856819262, now seen corresponding path program 1 times [2025-03-08 05:42:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:23,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794250247] [2025-03-08 05:42:23,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:23,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 05:42:23,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 05:42:23,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:23,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,569 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-08 05:42:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794250247] [2025-03-08 05:42:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794250247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:23,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209704404] [2025-03-08 05:42:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:23,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:23,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:23,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:23,572 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-03-08 05:42:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:23,630 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-08 05:42:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-03-08 05:42:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:23,632 INFO L225 Difference]: With dead ends: 25 [2025-03-08 05:42:23,632 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 05:42:23,633 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-03-08 05:42:23,634 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:23,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 05:42:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-08 05:42:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 05:42:23,642 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2025-03-08 05:42:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:23,642 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 05:42:23,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-03-08 05:42:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 05:42:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 05:42:23,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:23,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:23,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:42:23,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 87542200, now seen corresponding path program 1 times [2025-03-08 05:42:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251066630] [2025-03-08 05:42:23,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:23,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:23,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:23,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:23,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:23,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251066630] [2025-03-08 05:42:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251066630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123593097] [2025-03-08 05:42:23,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:23,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:23,754 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-08 05:42:23,756 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-08 05:42:23,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:23,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:23,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:42:23,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:24,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123593097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:24,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:24,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2025-03-08 05:42:24,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98941870] [2025-03-08 05:42:24,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:24,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:42:24,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:24,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:42:24,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:42:24,091 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 05:42:24,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:24,184 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-03-08 05:42:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:42:24,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2025-03-08 05:42:24,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:24,185 INFO L225 Difference]: With dead ends: 43 [2025-03-08 05:42:24,185 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 05:42:24,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:42:24,186 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:24,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 05:42:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 05:42:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:42:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-08 05:42:24,195 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 24 [2025-03-08 05:42:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:24,195 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-08 05:42:24,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 05:42:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-08 05:42:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:42:24,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:24,196 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:24,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:42:24,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:24,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:24,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1893551651, now seen corresponding path program 1 times [2025-03-08 05:42:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:24,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438732226] [2025-03-08 05:42:24,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:24,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:42:24,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:42:24,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:24,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 05:42:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438732226] [2025-03-08 05:42:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438732226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926395241] [2025-03-08 05:42:24,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:24,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:24,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:24,565 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-08 05:42:24,567 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-08 05:42:24,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:42:24,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:42:24,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:24,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:24,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:42:24,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 05:42:24,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 05:42:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926395241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:25,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:25,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2025-03-08 05:42:25,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417150373] [2025-03-08 05:42:25,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:42:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:25,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:42:25,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:42:25,010 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-08 05:42:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:25,121 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2025-03-08 05:42:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:42:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 65 [2025-03-08 05:42:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:25,123 INFO L225 Difference]: With dead ends: 45 [2025-03-08 05:42:25,123 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 05:42:25,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:42:25,123 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:25,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 05:42:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-08 05:42:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-08 05:42:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2025-03-08 05:42:25,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 65 [2025-03-08 05:42:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:25,135 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2025-03-08 05:42:25,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-08 05:42:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2025-03-08 05:42:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:42:25,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:25,141 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 10, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:25,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:42:25,342 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,SelfDestructingSolverStorable3 [2025-03-08 05:42:25,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:25,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash -233523865, now seen corresponding path program 2 times [2025-03-08 05:42:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926906644] [2025-03-08 05:42:25,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:25,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-08 05:42:25,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:42:25,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:25,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 158 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-08 05:42:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926906644] [2025-03-08 05:42:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926906644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391126944] [2025-03-08 05:42:25,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:25,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:25,510 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-08 05:42:25,513 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-08 05:42:25,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-08 05:42:25,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:42:25,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:25,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:25,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:42:25,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 158 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-08 05:42:25,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 170 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-08 05:42:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391126944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:26,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:26,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 12 [2025-03-08 05:42:26,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551653481] [2025-03-08 05:42:26,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:26,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:42:26,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:26,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:42:26,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:42:26,136 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 05:42:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:26,215 INFO L93 Difference]: Finished difference Result 66 states and 163 transitions. [2025-03-08 05:42:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:42:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 105 [2025-03-08 05:42:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:26,217 INFO L225 Difference]: With dead ends: 66 [2025-03-08 05:42:26,217 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 05:42:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:42:26,218 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:26,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 05:42:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2025-03-08 05:42:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-08 05:42:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2025-03-08 05:42:26,231 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 105 [2025-03-08 05:42:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:26,232 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2025-03-08 05:42:26,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-08 05:42:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2025-03-08 05:42:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 05:42:26,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:26,234 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:26,240 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-08 05:42:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:26,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1897643458, now seen corresponding path program 3 times [2025-03-08 05:42:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123800428] [2025-03-08 05:42:26,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:26,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 204 statements into 24 equivalence classes. [2025-03-08 05:42:26,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 204 statements. [2025-03-08 05:42:26,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 05:42:26,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 586 proven. 36 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2025-03-08 05:42:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123800428] [2025-03-08 05:42:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123800428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685994486] [2025-03-08 05:42:26,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:26,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:26,560 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-08 05:42:26,561 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-08 05:42:26,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 204 statements into 24 equivalence classes. [2025-03-08 05:42:26,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 204 statements. [2025-03-08 05:42:26,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 05:42:26,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:26,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:42:26,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 712 proven. 16 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2025-03-08 05:42:26,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 588 proven. 34 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2025-03-08 05:42:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685994486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:27,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-08 05:42:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443456670] [2025-03-08 05:42:27,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:42:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:27,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:42:27,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:27,248 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:42:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:27,331 INFO L93 Difference]: Finished difference Result 81 states and 177 transitions. [2025-03-08 05:42:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:42:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 204 [2025-03-08 05:42:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:27,334 INFO L225 Difference]: With dead ends: 81 [2025-03-08 05:42:27,334 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 05:42:27,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:42:27,335 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:27,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 86 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 05:42:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2025-03-08 05:42:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (36), 11 states have call predecessors, (36), 7 states have call successors, (36) [2025-03-08 05:42:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 73 transitions. [2025-03-08 05:42:27,344 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 73 transitions. Word has length 204 [2025-03-08 05:42:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:27,344 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 73 transitions. [2025-03-08 05:42:27,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:42:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 73 transitions. [2025-03-08 05:42:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 05:42:27,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:27,345 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 25, 13, 13, 13, 13, 13, 13, 13, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:27,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:27,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 615781560, now seen corresponding path program 4 times [2025-03-08 05:42:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349284728] [2025-03-08 05:42:27,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:27,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 192 statements into 2 equivalence classes. [2025-03-08 05:42:27,571 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 162 of 192 statements. [2025-03-08 05:42:27,571 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:27,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 299 proven. 127 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2025-03-08 05:42:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:27,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349284728] [2025-03-08 05:42:27,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349284728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:27,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183813703] [2025-03-08 05:42:27,739 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:27,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:27,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:27,741 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-08 05:42:27,743 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-08 05:42:27,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 192 statements into 2 equivalence classes. [2025-03-08 05:42:27,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 162 of 192 statements. [2025-03-08 05:42:27,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:27,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:27,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:42:27,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 200 proven. 416 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2025-03-08 05:42:27,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 202 proven. 436 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2025-03-08 05:42:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183813703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:28,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:28,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 21 [2025-03-08 05:42:28,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144729261] [2025-03-08 05:42:28,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:28,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:42:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:28,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:42:28,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:42:28,766 INFO L87 Difference]: Start difference. First operand 43 states and 73 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 11 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 13 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-08 05:42:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:28,997 INFO L93 Difference]: Finished difference Result 130 states and 355 transitions. [2025-03-08 05:42:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:42:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 11 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 13 states have call predecessors, (22), 11 states have call successors, (22) Word has length 192 [2025-03-08 05:42:28,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:29,000 INFO L225 Difference]: With dead ends: 130 [2025-03-08 05:42:29,000 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 05:42:29,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 368 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-03-08 05:42:29,005 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:29,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 05:42:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-08 05:42:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 05:42:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-08 05:42:29,013 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 192 [2025-03-08 05:42:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:29,015 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-08 05:42:29,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 states have internal predecessors, (61), 11 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 13 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-08 05:42:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-08 05:42:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:42:29,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:29,018 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:29,024 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-08 05:42:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:29,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2078407705, now seen corresponding path program 5 times [2025-03-08 05:42:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136858893] [2025-03-08 05:42:29,222 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:29,229 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 107 statements into 13 equivalence classes. [2025-03-08 05:42:29,243 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:42:29,243 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 05:42:29,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:42:29,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:42:29,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:42:29,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:42:29,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:29,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:42:29,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:42:29,272 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:42:29,273 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:42:29,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:42:29,276 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2025-03-08 05:42:29,304 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:42:29,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:42:29 BoogieIcfgContainer [2025-03-08 05:42:29,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:42:29,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:42:29,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:42:29,310 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:42:29,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:23" (3/4) ... [2025-03-08 05:42:29,311 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:42:29,354 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 60. [2025-03-08 05:42:29,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:42:29,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:42:29,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:42:29,422 INFO L158 Benchmark]: Toolchain (without parser) took 6709.49ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.8MB in the beginning and 161.4MB in the end (delta: -57.6MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2025-03-08 05:42:29,422 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:29,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.73ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 93.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:29,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.28ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:29,423 INFO L158 Benchmark]: Boogie Preprocessor took 22.26ms. Allocated memory is still 142.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:29,423 INFO L158 Benchmark]: IcfgBuilder took 185.68ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 81.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:29,423 INFO L158 Benchmark]: TraceAbstraction took 6216.14ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 80.5MB in the beginning and 169.8MB in the end (delta: -89.3MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. [2025-03-08 05:42:29,423 INFO L158 Benchmark]: Witness Printer took 111.29ms. Allocated memory is still 327.2MB. Free memory was 169.8MB in the beginning and 161.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:29,424 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.73ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 93.1MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.28ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.26ms. Allocated memory is still 142.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 185.68ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 81.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6216.14ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 80.5MB in the beginning and 169.8MB in the end (delta: -89.3MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. * Witness Printer took 111.29ms. Allocated memory is still 327.2MB. Free memory was 169.8MB in the beginning and 161.4MB in the end (delta: 8.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: 38]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] COND FALSE !(x > 46) VAL [x=5] [L34] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L34] RET, EXPR fibonacci(x) VAL [x=5] [L34] int result = fibonacci(x); [L35] COND FALSE !(x != 5 || result == 3) [L38] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 28 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 383 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 567 IncrementalHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 122 mSDtfsCounter, 567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1250 GetRequests, 1145 SyntacticMatches, 18 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 41 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1310 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1776 ConstructedInterpolants, 0 QuantifiedInterpolants, 2731 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 13354/15144 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-03-08 05:42:29,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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