./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann04.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/Ackermann04.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 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:08,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:08,987 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:08,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:08,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:09,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:09,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:09,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:09,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:09,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:09,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:09,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:09,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:09,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:09,011 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:09,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:09,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:09,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:09,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:09,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:09,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:09,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:09,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:09,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:09,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:09,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:09,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:09,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:09,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:09,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:09,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:09,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:09,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:09,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:09,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:09,015 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 -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 [2025-03-08 05:42:09,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:09,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:09,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:09,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:09,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:09,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann04.c [2025-03-08 05:42:10,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a346cf633/8e5c92b7a1374adb84ee6defc038a55f/FLAG5adc5951b [2025-03-08 05:42:10,644 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:10,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2025-03-08 05:42:10,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a346cf633/8e5c92b7a1374adb84ee6defc038a55f/FLAG5adc5951b [2025-03-08 05:42:10,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a346cf633/8e5c92b7a1374adb84ee6defc038a55f [2025-03-08 05:42:10,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:10,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:10,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:10,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:10,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:10,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:10" (1/1) ... [2025-03-08 05:42:10,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:10, skipping insertion in model container [2025-03-08 05:42:10,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:10" (1/1) ... [2025-03-08 05:42:10,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:11,127 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/Ackermann04.c[1166,1179] [2025-03-08 05:42:11,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:11,140 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:11,155 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/Ackermann04.c[1166,1179] [2025-03-08 05:42:11,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:11,172 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:11,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:11 WrapperNode [2025-03-08 05:42:11,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:11,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:11,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:11,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:11,181 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:11" (1/1) ... [2025-03-08 05:42:11,187 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:11" (1/1) ... [2025-03-08 05:42:11,200 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-03-08 05:42:11,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:11,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:11,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:11,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:11,209 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:11" (1/1) ... [2025-03-08 05:42:11,210 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:11" (1/1) ... [2025-03-08 05:42:11,215 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:11" (1/1) ... [2025-03-08 05:42:11,226 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:11,227 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:11" (1/1) ... [2025-03-08 05:42:11,227 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:11" (1/1) ... [2025-03-08 05:42:11,228 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:11" (1/1) ... [2025-03-08 05:42:11,229 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:11" (1/1) ... [2025-03-08 05:42:11,229 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:11" (1/1) ... [2025-03-08 05:42:11,229 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:11" (1/1) ... [2025-03-08 05:42:11,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:11,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:11,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:11,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:11,231 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:11" (1/1) ... [2025-03-08 05:42:11,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:11,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:11,262 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:11,271 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:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:11,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:11,287 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2025-03-08 05:42:11,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2025-03-08 05:42:11,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:11,325 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:11,327 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:11,415 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5;havoc #t~ret6; [2025-03-08 05:42:11,415 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4; [2025-03-08 05:42:11,429 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:11,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:11,437 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:11,438 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:11,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:11 BoogieIcfgContainer [2025-03-08 05:42:11,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:11,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:11,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:11,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:11,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:10" (1/3) ... [2025-03-08 05:42:11,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29982196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:11, skipping insertion in model container [2025-03-08 05:42:11,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:11" (2/3) ... [2025-03-08 05:42:11,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29982196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:11, skipping insertion in model container [2025-03-08 05:42:11,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:11" (3/3) ... [2025-03-08 05:42:11,446 INFO L128 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2025-03-08 05:42:11,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:11,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Ackermann04.c that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:42:11,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:11,513 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;@4778b0dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:11,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:42:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:42:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 05:42:11,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:11,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:11,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:11,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash -640999361, now seen corresponding path program 1 times [2025-03-08 05:42:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:11,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672450506] [2025-03-08 05:42:11,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:11,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 05:42:11,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 05:42:11,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:11,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:11,726 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:11,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672450506] [2025-03-08 05:42:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672450506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:11,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:11,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233963233] [2025-03-08 05:42:11,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:11,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:11,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:11,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:11,744 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 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:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:11,873 INFO L93 Difference]: Finished difference Result 37 states and 53 transitions. [2025-03-08 05:42:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:11,876 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:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:11,881 INFO L225 Difference]: With dead ends: 37 [2025-03-08 05:42:11,881 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 05:42:11,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:11,888 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:11,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 05:42:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-08 05:42:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 05:42:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-08 05:42:11,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 12 [2025-03-08 05:42:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:11,918 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-08 05:42:11,918 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:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-03-08 05:42:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:42:11,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:11,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:11,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:11,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:11,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1861650847, now seen corresponding path program 1 times [2025-03-08 05:42:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041125801] [2025-03-08 05:42:11,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:11,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:42:11,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:42:11,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:11,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:12,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:12,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041125801] [2025-03-08 05:42:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041125801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:12,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928884772] [2025-03-08 05:42:12,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:12,015 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:12,016 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:12,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:42:12,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:42:12,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:12,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:12,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:42:12,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:12,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928884772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:12,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 05:42:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678652690] [2025-03-08 05:42:12,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:12,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:42:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:12,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:42:12,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:12,213 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 05:42:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:12,334 INFO L93 Difference]: Finished difference Result 69 states and 124 transitions. [2025-03-08 05:42:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2025-03-08 05:42:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:12,336 INFO L225 Difference]: With dead ends: 69 [2025-03-08 05:42:12,336 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:42:12,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:12,337 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:12,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 66 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:42:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-08 05:42:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (27), 10 states have call predecessors, (27), 8 states have call successors, (27) [2025-03-08 05:42:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2025-03-08 05:42:12,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 19 [2025-03-08 05:42:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:12,346 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2025-03-08 05:42:12,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 05:42:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2025-03-08 05:42:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 05:42:12,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:12,351 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:12,359 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:12,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:12,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:12,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1457087151, now seen corresponding path program 1 times [2025-03-08 05:42:12,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:12,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950766649] [2025-03-08 05:42:12,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:12,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 05:42:12,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 05:42:12,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:12,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:42:12,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:12,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950766649] [2025-03-08 05:42:12,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950766649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:12,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485898394] [2025-03-08 05:42:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:12,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:12,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:12,770 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:12,771 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:12,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 05:42:12,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 05:42:12,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:12,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:12,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:42:12,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:42:12,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:42:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485898394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:13,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 8 [2025-03-08 05:42:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883864424] [2025-03-08 05:42:13,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:42:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:13,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:42:13,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:13,352 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:42:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:13,459 INFO L93 Difference]: Finished difference Result 62 states and 124 transitions. [2025-03-08 05:42:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:13,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2025-03-08 05:42:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:13,461 INFO L225 Difference]: With dead ends: 62 [2025-03-08 05:42:13,461 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 05:42:13,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:42:13,462 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:13,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 68 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 05:42:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-08 05:42:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (60), 15 states have call predecessors, (60), 10 states have call successors, (60) [2025-03-08 05:42:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 109 transitions. [2025-03-08 05:42:13,483 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 109 transitions. Word has length 45 [2025-03-08 05:42:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:13,483 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 109 transitions. [2025-03-08 05:42:13,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:42:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 109 transitions. [2025-03-08 05:42:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:42:13,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:13,489 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:13,496 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:13,689 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,SelfDestructingSolverStorable2 [2025-03-08 05:42:13,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1906797306, now seen corresponding path program 2 times [2025-03-08 05:42:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218375425] [2025-03-08 05:42:13,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:13,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-08 05:42:13,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:42:13,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:13,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 124 proven. 289 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-08 05:42:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218375425] [2025-03-08 05:42:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218375425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642785089] [2025-03-08 05:42:14,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:14,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:14,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:14,018 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:14,024 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:14,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-08 05:42:14,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:42:14,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:14,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:14,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:42:14,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 360 proven. 86 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-08 05:42:14,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 115 proven. 179 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-08 05:42:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642785089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:15,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:15,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 33 [2025-03-08 05:42:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523609468] [2025-03-08 05:42:15,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:15,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 05:42:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:15,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 05:42:15,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:42:15,560 INFO L87 Difference]: Start difference. First operand 54 states and 109 transitions. Second operand has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 27 states have internal predecessors, (80), 12 states have call successors, (20), 2 states have call predecessors, (20), 16 states have return successors, (32), 18 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-08 05:42:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:16,368 INFO L93 Difference]: Finished difference Result 144 states and 411 transitions. [2025-03-08 05:42:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 05:42:16,368 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 27 states have internal predecessors, (80), 12 states have call successors, (20), 2 states have call predecessors, (20), 16 states have return successors, (32), 18 states have call predecessors, (32), 12 states have call successors, (32) Word has length 119 [2025-03-08 05:42:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:16,371 INFO L225 Difference]: With dead ends: 144 [2025-03-08 05:42:16,371 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 05:42:16,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=620, Invalid=3286, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 05:42:16,375 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 129 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:16,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 224 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:42:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 05:42:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2025-03-08 05:42:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 15 states have call successors, (15), 7 states have call predecessors, (15), 11 states have return successors, (68), 16 states have call predecessors, (68), 15 states have call successors, (68) [2025-03-08 05:42:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 143 transitions. [2025-03-08 05:42:16,392 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 143 transitions. Word has length 119 [2025-03-08 05:42:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 143 transitions. [2025-03-08 05:42:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 27 states have internal predecessors, (80), 12 states have call successors, (20), 2 states have call predecessors, (20), 16 states have return successors, (32), 18 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-08 05:42:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 143 transitions. [2025-03-08 05:42:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:42:16,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:16,405 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:16,411 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:16,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:16,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:16,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2014828494, now seen corresponding path program 3 times [2025-03-08 05:42:16,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:16,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332511165] [2025-03-08 05:42:16,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:16,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 13 equivalence classes. [2025-03-08 05:42:16,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 72 of 105 statements. [2025-03-08 05:42:16,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 05:42:16,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 192 proven. 78 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-08 05:42:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332511165] [2025-03-08 05:42:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332511165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852750520] [2025-03-08 05:42:16,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:16,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:16,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:16,933 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:16,936 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:16,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 13 equivalence classes. [2025-03-08 05:42:17,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 72 of 105 statements. [2025-03-08 05:42:17,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 05:42:17,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:17,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:42:17,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 190 proven. 71 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-08 05:42:17,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 208 proven. 61 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-08 05:42:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852750520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:18,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:18,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 15] total 30 [2025-03-08 05:42:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766264779] [2025-03-08 05:42:18,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:18,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 05:42:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:18,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 05:42:18,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-03-08 05:42:18,166 INFO L87 Difference]: Start difference. First operand 79 states and 143 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 25 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 14 states have return successors, (27), 15 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-08 05:42:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:18,575 INFO L93 Difference]: Finished difference Result 187 states and 393 transitions. [2025-03-08 05:42:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 05:42:18,577 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 25 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 14 states have return successors, (27), 15 states have call predecessors, (27), 12 states have call successors, (27) Word has length 105 [2025-03-08 05:42:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:18,580 INFO L225 Difference]: With dead ends: 187 [2025-03-08 05:42:18,580 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 05:42:18,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 193 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 05:42:18,586 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:18,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 178 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 05:42:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2025-03-08 05:42:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 59 states have internal predecessors, (65), 15 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (46), 16 states have call predecessors, (46), 15 states have call successors, (46) [2025-03-08 05:42:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 126 transitions. [2025-03-08 05:42:18,608 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 126 transitions. Word has length 105 [2025-03-08 05:42:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:18,608 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 126 transitions. [2025-03-08 05:42:18,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 25 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 14 states have return successors, (27), 15 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-08 05:42:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 126 transitions. [2025-03-08 05:42:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:42:18,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:18,610 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:18,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:42:18,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:18,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:18,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash 284498204, now seen corresponding path program 4 times [2025-03-08 05:42:18,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:18,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237127682] [2025-03-08 05:42:18,815 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:18,821 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 131 statements into 2 equivalence classes. [2025-03-08 05:42:18,840 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:42:18,841 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:42:18,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 141 proven. 304 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 05:42:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237127682] [2025-03-08 05:42:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237127682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823646507] [2025-03-08 05:42:19,116 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:19,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:19,118 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:19,120 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:19,171 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 131 statements into 2 equivalence classes. [2025-03-08 05:42:19,201 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:42:19,202 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:42:19,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:19,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:42:19,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-08 05:42:19,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 155 proven. 295 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-03-08 05:42:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823646507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:20,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 17] total 20 [2025-03-08 05:42:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990264378] [2025-03-08 05:42:20,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:20,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:42:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:42:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:42:20,538 INFO L87 Difference]: Start difference. First operand 85 states and 126 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (17), 2 states have call predecessors, (17), 10 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-08 05:42:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:20,788 INFO L93 Difference]: Finished difference Result 176 states and 299 transitions. [2025-03-08 05:42:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 05:42:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (17), 2 states have call predecessors, (17), 10 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) Word has length 131 [2025-03-08 05:42:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:20,789 INFO L225 Difference]: With dead ends: 176 [2025-03-08 05:42:20,790 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 05:42:20,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 251 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 05:42:20,791 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:20,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 177 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 05:42:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 05:42:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (59), 22 states have call predecessors, (59), 18 states have call successors, (59) [2025-03-08 05:42:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2025-03-08 05:42:20,810 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 131 [2025-03-08 05:42:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:20,811 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2025-03-08 05:42:20,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (17), 2 states have call predecessors, (17), 10 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-08 05:42:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2025-03-08 05:42:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:42:20,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:20,812 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:20,819 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:21,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:21,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:21,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1579822898, now seen corresponding path program 5 times [2025-03-08 05:42:21,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:21,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052292028] [2025-03-08 05:42:21,018 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:21,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:21,024 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 157 statements into 15 equivalence classes. [2025-03-08 05:42:21,043 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 136 of 157 statements. [2025-03-08 05:42:21,044 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 05:42:21,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 424 proven. 295 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-03-08 05:42:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052292028] [2025-03-08 05:42:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052292028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987922104] [2025-03-08 05:42:21,453 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:21,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:21,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:21,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:42:21,529 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 157 statements into 15 equivalence classes. [2025-03-08 05:42:21,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 136 of 157 statements. [2025-03-08 05:42:21,566 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 05:42:21,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:21,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 05:42:21,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-03-08 05:42:21,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-03-08 05:42:24,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987922104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:24,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:24,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 27] total 34 [2025-03-08 05:42:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303791776] [2025-03-08 05:42:24,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:24,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 05:42:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:24,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 05:42:24,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 05:42:24,556 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 28 states have internal predecessors, (74), 14 states have call successors, (17), 1 states have call predecessors, (17), 16 states have return successors, (31), 17 states have call predecessors, (31), 14 states have call successors, (31) [2025-03-08 05:42:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:24,979 INFO L93 Difference]: Finished difference Result 206 states and 357 transitions. [2025-03-08 05:42:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 05:42:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 28 states have internal predecessors, (74), 14 states have call successors, (17), 1 states have call predecessors, (17), 16 states have return successors, (31), 17 states have call predecessors, (31), 14 states have call successors, (31) Word has length 157 [2025-03-08 05:42:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:24,984 INFO L225 Difference]: With dead ends: 206 [2025-03-08 05:42:24,984 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 05:42:24,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 298 SyntacticMatches, 14 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=614, Invalid=2692, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 05:42:24,987 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:24,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 308 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 05:42:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 05:42:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 21 states have call successors, (21), 9 states have call predecessors, (21), 17 states have return successors, (80), 28 states have call predecessors, (80), 21 states have call successors, (80) [2025-03-08 05:42:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 184 transitions. [2025-03-08 05:42:25,006 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 184 transitions. Word has length 157 [2025-03-08 05:42:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:25,008 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 184 transitions. [2025-03-08 05:42:25,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 28 states have internal predecessors, (74), 14 states have call successors, (17), 1 states have call predecessors, (17), 16 states have return successors, (31), 17 states have call predecessors, (31), 14 states have call successors, (31) [2025-03-08 05:42:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2025-03-08 05:42:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 05:42:25,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:25,010 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:25,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:25,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:25,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:25,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash -841014366, now seen corresponding path program 6 times [2025-03-08 05:42:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:25,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272988690] [2025-03-08 05:42:25,211 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:25,219 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 183 statements into 18 equivalence classes. [2025-03-08 05:42:25,265 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:42:25,269 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-03-08 05:42:25,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 688 proven. 74 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2025-03-08 05:42:25,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:25,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272988690] [2025-03-08 05:42:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272988690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:25,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056640750] [2025-03-08 05:42:25,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:42:25,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:25,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:25,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:25,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:42:26,027 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 183 statements into 18 equivalence classes. [2025-03-08 05:42:26,073 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 05:42:26,073 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-03-08 05:42:26,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:26,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 05:42:26,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2025-03-08 05:42:26,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2025-03-08 05:42:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056640750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:30,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 33] total 38 [2025-03-08 05:42:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697226770] [2025-03-08 05:42:30,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:30,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 05:42:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:30,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 05:42:30,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 05:42:30,986 INFO L87 Difference]: Start difference. First operand 115 states and 184 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2025-03-08 05:42:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:31,916 INFO L93 Difference]: Finished difference Result 192 states and 342 transitions. [2025-03-08 05:42:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 05:42:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 183 [2025-03-08 05:42:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:31,920 INFO L225 Difference]: With dead ends: 192 [2025-03-08 05:42:31,920 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 05:42:31,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 343 SyntacticMatches, 20 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1027, Invalid=4673, Unknown=0, NotChecked=0, Total=5700 [2025-03-08 05:42:31,923 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 81 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:31,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 274 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:42:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 05:42:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 138. [2025-03-08 05:42:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 92 states have internal predecessors, (98), 22 states have call successors, (22), 9 states have call predecessors, (22), 24 states have return successors, (121), 36 states have call predecessors, (121), 22 states have call successors, (121) [2025-03-08 05:42:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 241 transitions. [2025-03-08 05:42:31,952 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 241 transitions. Word has length 183 [2025-03-08 05:42:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:31,953 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 241 transitions. [2025-03-08 05:42:31,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2025-03-08 05:42:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 241 transitions. [2025-03-08 05:42:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 05:42:31,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:31,956 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:31,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:42:32,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:32,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -682904789, now seen corresponding path program 7 times [2025-03-08 05:42:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458234487] [2025-03-08 05:42:32,157 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:32,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:42:32,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:42:32,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:32,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 495 proven. 368 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2025-03-08 05:42:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458234487] [2025-03-08 05:42:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458234487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087659013] [2025-03-08 05:42:32,587 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:42:32,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:32,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:32,592 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:32,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:42:32,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:42:32,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:42:32,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:32,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:32,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 05:42:32,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-08 05:42:32,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-08 05:42:35,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087659013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:35,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:35,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 32 [2025-03-08 05:42:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609819172] [2025-03-08 05:42:35,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:35,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 05:42:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:35,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 05:42:35,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:42:35,842 INFO L87 Difference]: Start difference. First operand 138 states and 241 transitions. Second operand has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (18), 1 states have call predecessors, (18), 17 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2025-03-08 05:42:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:36,444 INFO L93 Difference]: Finished difference Result 282 states and 571 transitions. [2025-03-08 05:42:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 05:42:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (18), 1 states have call predecessors, (18), 17 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) Word has length 170 [2025-03-08 05:42:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:36,446 INFO L225 Difference]: With dead ends: 282 [2025-03-08 05:42:36,446 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:42:36,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 323 SyntacticMatches, 19 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=930, Invalid=3762, Unknown=0, NotChecked=0, Total=4692 [2025-03-08 05:42:36,450 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 112 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:36,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 216 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:42:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:42:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:42:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:42:36,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2025-03-08 05:42:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:36,453 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:42:36,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (18), 1 states have call predecessors, (18), 17 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2025-03-08 05:42:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:42:36,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:42:36,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:42:36,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 05:42:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 05:42:36,659 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2025-03-08 05:42:36,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:42:39,406 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:42:39,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:42:39 BoogieIcfgContainer [2025-03-08 05:42:39,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:42:39,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:42:39,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:42:39,411 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:42:39,412 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:11" (3/4) ... [2025-03-08 05:42:39,413 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:42:39,420 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ackermann [2025-03-08 05:42:39,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 05:42:39,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 05:42:39,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:42:39,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:42:39,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:42:39,477 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:42:39,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:42:39,477 INFO L158 Benchmark]: Toolchain (without parser) took 28495.31ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 106.2MB in the beginning and 417.7MB in the end (delta: -311.5MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-03-08 05:42:39,477 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:39,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.14ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.7MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:39,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.20ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 94.0MB in the end (delta: 739.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:39,478 INFO L158 Benchmark]: Boogie Preprocessor took 28.55ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:39,479 INFO L158 Benchmark]: IcfgBuilder took 207.83ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.3MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:39,479 INFO L158 Benchmark]: TraceAbstraction took 27970.44ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 81.3MB in the beginning and 421.8MB in the end (delta: -340.6MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. [2025-03-08 05:42:39,479 INFO L158 Benchmark]: Witness Printer took 65.60ms. Allocated memory is still 494.9MB. Free memory was 421.8MB in the beginning and 417.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:39,480 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.13ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.14ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.7MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.20ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 94.0MB in the end (delta: 739.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.55ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 207.83ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.3MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27970.44ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 81.3MB in the beginning and 421.8MB in the end (delta: -340.6MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. * Witness Printer took 65.60ms. Allocated memory is still 494.9MB. Free memory was 421.8MB in the beginning and 417.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 34 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 9, TraceHistogramMax: 27, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 508 mSDsluCounter, 1582 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1359 mSDsCounter, 647 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3645 IncrementalHoareTripleChecker+Invalid, 4292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 647 mSolverCounterUnsat, 223 mSDtfsCounter, 3645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2192 GetRequests, 1759 SyntacticMatches, 75 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5265 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=8, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 80 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 1870 NumberOfCodeBlocks, 1762 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 2774 ConstructedInterpolants, 0 QuantifiedInterpolants, 5436 SizeOfPredicates, 27 NumberOfNonLiveVariables, 2679 ConjunctsInSsa, 183 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 15880/19659 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 05:42:39,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE