./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/eca-rers2012/Problem14_label09.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 1b3a5c95c10076386b15606d0ac6559403dceee57f74bca8a711eb692be2f98e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:05:11,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:05:11,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:05:11,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:05:11,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:05:11,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:05:11,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:05:11,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:05:11,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:05:11,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:05:11,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:05:11,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:05:11,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:05:11,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:05:11,362 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:05:11,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:05:11,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:05:11,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:05:11,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:05:11,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:05:11,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:05:11,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:05:11,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:05:11,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:05:11,365 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 -> 1b3a5c95c10076386b15606d0ac6559403dceee57f74bca8a711eb692be2f98e [2025-03-16 15:05:11,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:05:11,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:05:11,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:05:11,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:05:11,620 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:05:11,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2025-03-16 15:05:12,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e51310d1/3a7548b41ead4b1a99824b12728b0967/FLAGcc85098d8 [2025-03-16 15:05:13,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:05:13,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2025-03-16 15:05:13,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e51310d1/3a7548b41ead4b1a99824b12728b0967/FLAGcc85098d8 [2025-03-16 15:05:13,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e51310d1/3a7548b41ead4b1a99824b12728b0967 [2025-03-16 15:05:13,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:05:13,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:05:13,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:05:13,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:05:13,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:05:13,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150732d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13, skipping insertion in model container [2025-03-16 15:05:13,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:05:13,496 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/eca-rers2012/Problem14_label09.c[4722,4735] [2025-03-16 15:05:13,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:05:13,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:05:13,666 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/eca-rers2012/Problem14_label09.c[4722,4735] [2025-03-16 15:05:13,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:05:13,735 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:05:13,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13 WrapperNode [2025-03-16 15:05:13,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:05:13,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:05:13,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:05:13,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:05:13,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,813 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:05:13,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:05:13,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:05:13,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:05:13,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:05:13,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,860 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-16 15:05:13,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:05:13,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:05:13,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:05:13,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:05:13,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (1/1) ... [2025-03-16 15:05:13,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:05:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:13,948 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-16 15:05:13,954 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-16 15:05:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:05:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:05:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:05:13,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:05:14,013 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:05:14,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:05:15,014 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:05:15,014 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:05:15,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:05:15,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:05:15,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:05:15 BoogieIcfgContainer [2025-03-16 15:05:15,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:05:15,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:05:15,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:05:15,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:05:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:05:13" (1/3) ... [2025-03-16 15:05:15,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d047c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:05:15, skipping insertion in model container [2025-03-16 15:05:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:05:13" (2/3) ... [2025-03-16 15:05:15,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d047c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:05:15, skipping insertion in model container [2025-03-16 15:05:15,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:05:15" (3/3) ... [2025-03-16 15:05:15,036 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2025-03-16 15:05:15,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:05:15,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label09.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:05:15,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:05:15,098 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;@119f5dcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:05:15,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:05:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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-16 15:05:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 15:05:15,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:15,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:15,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -14795123, now seen corresponding path program 1 times [2025-03-16 15:05:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048709382] [2025-03-16 15:05:15,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:15,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 15:05:15,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 15:05:15,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:15,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:15,226 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-16 15:05:15,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:15,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048709382] [2025-03-16 15:05:15,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048709382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:15,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:15,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:05:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708688263] [2025-03-16 15:05:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:15,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:05:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:15,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:05:15,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:05:15,248 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-16 15:05:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:15,274 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:05:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:05:15,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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) Word has length 44 [2025-03-16 15:05:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:15,285 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:05:15,286 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:05:15,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:05:15,292 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:15,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:05:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:05:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:05:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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-16 15:05:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:05:15,333 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 44 [2025-03-16 15:05:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:15,333 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:05:15,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-16 15:05:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:05:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 15:05:15,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:15,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:15,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:05:15,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:15,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -714615085, now seen corresponding path program 1 times [2025-03-16 15:05:15,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:15,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659010917] [2025-03-16 15:05:15,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:15,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 15:05:15,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 15:05:15,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:15,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:15,589 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-16 15:05:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659010917] [2025-03-16 15:05:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659010917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:15,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826324218] [2025-03-16 15:05:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:05:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:15,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:05:15,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:15,591 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-16 15:05:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:16,668 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2025-03-16 15:05:16,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:16,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2025-03-16 15:05:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:16,671 INFO L225 Difference]: With dead ends: 717 [2025-03-16 15:05:16,671 INFO L226 Difference]: Without dead ends: 537 [2025-03-16 15:05:16,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:05:16,672 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 489 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:16,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 121 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:05:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-16 15:05:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-16 15:05:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 536 states have internal predecessors, (777), 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-16 15:05:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 777 transitions. [2025-03-16 15:05:16,709 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 777 transitions. Word has length 44 [2025-03-16 15:05:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:16,710 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 777 transitions. [2025-03-16 15:05:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-16 15:05:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 777 transitions. [2025-03-16 15:05:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 15:05:16,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:16,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:16,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:05:16,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:16,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash -854595588, now seen corresponding path program 1 times [2025-03-16 15:05:16,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:16,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198016259] [2025-03-16 15:05:16,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:16,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 15:05:16,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 15:05:16,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:16,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:05:17,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:17,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198016259] [2025-03-16 15:05:17,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198016259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:17,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:17,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559225421] [2025-03-16 15:05:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:17,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:05:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:17,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:05:17,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:17,031 INFO L87 Difference]: Start difference. First operand 537 states and 777 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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-16 15:05:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:17,696 INFO L93 Difference]: Finished difference Result 1280 states and 1977 transitions. [2025-03-16 15:05:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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) Word has length 124 [2025-03-16 15:05:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:17,699 INFO L225 Difference]: With dead ends: 1280 [2025-03-16 15:05:17,699 INFO L226 Difference]: Without dead ends: 893 [2025-03-16 15:05:17,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:17,702 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:17,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 117 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:05:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-16 15:05:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 715. [2025-03-16 15:05:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2212885154061626) internal successors, (872), 714 states have internal predecessors, (872), 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-16 15:05:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 872 transitions. [2025-03-16 15:05:17,723 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 872 transitions. Word has length 124 [2025-03-16 15:05:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:17,723 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 872 transitions. [2025-03-16 15:05:17,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 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-16 15:05:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 872 transitions. [2025-03-16 15:05:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 15:05:17,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:17,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:17,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:05:17,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:17,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2063631678, now seen corresponding path program 1 times [2025-03-16 15:05:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683301687] [2025-03-16 15:05:17,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:17,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:17,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 15:05:17,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 15:05:17,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:17,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:05:18,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683301687] [2025-03-16 15:05:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683301687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770866818] [2025-03-16 15:05:18,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:18,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:18,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:18,115 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-16 15:05:18,116 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-16 15:05:18,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 15:05:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 15:05:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:18,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:05:18,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 15:05:18,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:05:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770866818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:05:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-16 15:05:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500251162] [2025-03-16 15:05:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:18,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:18,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:18,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:05:18,426 INFO L87 Difference]: Start difference. First operand 715 states and 872 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-16 15:05:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:18,862 INFO L93 Difference]: Finished difference Result 1607 states and 2070 transitions. [2025-03-16 15:05:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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) Word has length 215 [2025-03-16 15:05:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:18,869 INFO L225 Difference]: With dead ends: 1607 [2025-03-16 15:05:18,870 INFO L226 Difference]: Without dead ends: 1071 [2025-03-16 15:05:18,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:05:18,871 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:18,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 46 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-16 15:05:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2025-03-16 15:05:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.2158878504672896) internal successors, (1301), 1070 states have internal predecessors, (1301), 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-16 15:05:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1301 transitions. [2025-03-16 15:05:18,891 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1301 transitions. Word has length 215 [2025-03-16 15:05:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:18,892 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1301 transitions. [2025-03-16 15:05:18,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-16 15:05:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1301 transitions. [2025-03-16 15:05:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 15:05:18,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:18,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:18,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:05:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:19,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:19,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash 545403801, now seen corresponding path program 1 times [2025-03-16 15:05:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207552133] [2025-03-16 15:05:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:19,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 15:05:19,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 15:05:19,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:19,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:05:19,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:19,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207552133] [2025-03-16 15:05:19,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207552133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:19,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:19,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643879937] [2025-03-16 15:05:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:19,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:19,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:19,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:19,321 INFO L87 Difference]: Start difference. First operand 1071 states and 1301 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-16 15:05:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:19,760 INFO L93 Difference]: Finished difference Result 2497 states and 3069 transitions. [2025-03-16 15:05:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:19,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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) Word has length 218 [2025-03-16 15:05:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:19,765 INFO L225 Difference]: With dead ends: 2497 [2025-03-16 15:05:19,765 INFO L226 Difference]: Without dead ends: 1605 [2025-03-16 15:05:19,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:19,767 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:19,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 76 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-16 15:05:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2025-03-16 15:05:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1689526184538654) internal successors, (1875), 1604 states have internal predecessors, (1875), 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-16 15:05:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1875 transitions. [2025-03-16 15:05:19,795 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1875 transitions. Word has length 218 [2025-03-16 15:05:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1875 transitions. [2025-03-16 15:05:19,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-16 15:05:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1875 transitions. [2025-03-16 15:05:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 15:05:19,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:19,799 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:19,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:05:19,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:19,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:19,799 INFO L85 PathProgramCache]: Analyzing trace with hash 816619835, now seen corresponding path program 1 times [2025-03-16 15:05:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916958202] [2025-03-16 15:05:19,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:19,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 15:05:19,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 15:05:19,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:19,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-03-16 15:05:20,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:20,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916958202] [2025-03-16 15:05:20,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916958202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:20,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:20,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:20,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227709140] [2025-03-16 15:05:20,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:20,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:05:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:20,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:05:20,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:20,093 INFO L87 Difference]: Start difference. First operand 1605 states and 1875 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 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-16 15:05:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:20,609 INFO L93 Difference]: Finished difference Result 3060 states and 3635 transitions. [2025-03-16 15:05:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 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) Word has length 335 [2025-03-16 15:05:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:20,616 INFO L225 Difference]: With dead ends: 3060 [2025-03-16 15:05:20,616 INFO L226 Difference]: Without dead ends: 1783 [2025-03-16 15:05:20,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:20,618 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:20,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 15 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:05:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-03-16 15:05:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1605. [2025-03-16 15:05:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.119700748129676) internal successors, (1796), 1604 states have internal predecessors, (1796), 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-16 15:05:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1796 transitions. [2025-03-16 15:05:20,647 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1796 transitions. Word has length 335 [2025-03-16 15:05:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:20,648 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1796 transitions. [2025-03-16 15:05:20,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 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-16 15:05:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1796 transitions. [2025-03-16 15:05:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-16 15:05:20,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:20,651 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:20,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:05:20,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash -166993763, now seen corresponding path program 1 times [2025-03-16 15:05:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732773083] [2025-03-16 15:05:20,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:20,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-16 15:05:20,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-16 15:05:20,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:20,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:05:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732773083] [2025-03-16 15:05:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732773083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184155052] [2025-03-16 15:05:21,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:21,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:21,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:21,017 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-16 15:05:21,019 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-16 15:05:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-16 15:05:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-16 15:05:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:21,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:05:21,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-16 15:05:21,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:05:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184155052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:21,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:05:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:05:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120275599] [2025-03-16 15:05:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:21,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:21,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:21,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:05:21,601 INFO L87 Difference]: Start difference. First operand 1605 states and 1796 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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-16 15:05:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:21,975 INFO L93 Difference]: Finished difference Result 2319 states and 2565 transitions. [2025-03-16 15:05:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:21,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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) Word has length 424 [2025-03-16 15:05:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:21,981 INFO L225 Difference]: With dead ends: 2319 [2025-03-16 15:05:21,981 INFO L226 Difference]: Without dead ends: 2317 [2025-03-16 15:05:21,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:05:21,982 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:21,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-16 15:05:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1427. [2025-03-16 15:05:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.0939691444600281) internal successors, (1560), 1426 states have internal predecessors, (1560), 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-16 15:05:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1560 transitions. [2025-03-16 15:05:22,008 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1560 transitions. Word has length 424 [2025-03-16 15:05:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:22,008 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1560 transitions. [2025-03-16 15:05:22,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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-16 15:05:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1560 transitions. [2025-03-16 15:05:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-16 15:05:22,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:22,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 15:05:22,020 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-16 15:05:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-16 15:05:22,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1554585831, now seen corresponding path program 1 times [2025-03-16 15:05:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545364372] [2025-03-16 15:05:22,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:22,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-16 15:05:22,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-16 15:05:22,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:22,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:05:22,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:22,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545364372] [2025-03-16 15:05:22,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545364372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:22,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:22,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:22,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163925524] [2025-03-16 15:05:22,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:22,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:22,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:22,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:22,553 INFO L87 Difference]: Start difference. First operand 1427 states and 1560 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-16 15:05:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:22,957 INFO L93 Difference]: Finished difference Result 3209 states and 3558 transitions. [2025-03-16 15:05:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:22,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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) Word has length 430 [2025-03-16 15:05:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:22,963 INFO L225 Difference]: With dead ends: 3209 [2025-03-16 15:05:22,963 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:05:22,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:22,965 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:22,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 243 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:05:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1605. [2025-03-16 15:05:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.0841645885286784) internal successors, (1739), 1604 states have internal predecessors, (1739), 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-16 15:05:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1739 transitions. [2025-03-16 15:05:22,988 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1739 transitions. Word has length 430 [2025-03-16 15:05:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1739 transitions. [2025-03-16 15:05:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-16 15:05:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1739 transitions. [2025-03-16 15:05:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-16 15:05:22,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:22,993 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:22,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:05:22,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash 577569028, now seen corresponding path program 1 times [2025-03-16 15:05:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810610538] [2025-03-16 15:05:22,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:22,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:23,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-16 15:05:23,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-16 15:05:23,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:05:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810610538] [2025-03-16 15:05:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810610538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577953801] [2025-03-16 15:05:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:23,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:23,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:23,261 INFO L87 Difference]: Start difference. First operand 1605 states and 1739 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-16 15:05:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:23,650 INFO L93 Difference]: Finished difference Result 3565 states and 3916 transitions. [2025-03-16 15:05:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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) Word has length 437 [2025-03-16 15:05:23,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:23,656 INFO L225 Difference]: With dead ends: 3565 [2025-03-16 15:05:23,656 INFO L226 Difference]: Without dead ends: 2139 [2025-03-16 15:05:23,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:23,658 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:23,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 218 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-03-16 15:05:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1961. [2025-03-16 15:05:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0877551020408163) internal successors, (2132), 1960 states have internal predecessors, (2132), 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-16 15:05:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2132 transitions. [2025-03-16 15:05:23,683 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2132 transitions. Word has length 437 [2025-03-16 15:05:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:23,683 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2132 transitions. [2025-03-16 15:05:23,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-16 15:05:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2132 transitions. [2025-03-16 15:05:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-16 15:05:23,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:23,686 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:23,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:05:23,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1912313243, now seen corresponding path program 1 times [2025-03-16 15:05:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516610179] [2025-03-16 15:05:23,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:23,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-16 15:05:23,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-16 15:05:23,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:23,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:05:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516610179] [2025-03-16 15:05:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516610179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:23,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:23,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773959291] [2025-03-16 15:05:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:23,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:23,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:23,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:23,856 INFO L87 Difference]: Start difference. First operand 1961 states and 2132 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-16 15:05:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:24,251 INFO L93 Difference]: Finished difference Result 4633 states and 5093 transitions. [2025-03-16 15:05:24,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:24,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) Word has length 478 [2025-03-16 15:05:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:24,260 INFO L225 Difference]: With dead ends: 4633 [2025-03-16 15:05:24,260 INFO L226 Difference]: Without dead ends: 2851 [2025-03-16 15:05:24,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:24,263 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:24,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 51 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-03-16 15:05:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2673. [2025-03-16 15:05:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0815868263473054) internal successors, (2890), 2672 states have internal predecessors, (2890), 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-16 15:05:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2890 transitions. [2025-03-16 15:05:24,305 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2890 transitions. Word has length 478 [2025-03-16 15:05:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:24,305 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2890 transitions. [2025-03-16 15:05:24,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-16 15:05:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2890 transitions. [2025-03-16 15:05:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-16 15:05:24,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:24,309 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:24,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:05:24,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash 301514810, now seen corresponding path program 1 times [2025-03-16 15:05:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:24,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75995500] [2025-03-16 15:05:24,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:24,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-16 15:05:24,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-16 15:05:24,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:24,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 15:05:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:24,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75995500] [2025-03-16 15:05:24,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75995500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:24,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005568620] [2025-03-16 15:05:24,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:24,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:24,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:24,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:24,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:24,648 INFO L87 Difference]: Start difference. First operand 2673 states and 2890 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-16 15:05:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:25,029 INFO L93 Difference]: Finished difference Result 5701 states and 6240 transitions. [2025-03-16 15:05:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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) Word has length 592 [2025-03-16 15:05:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:25,037 INFO L225 Difference]: With dead ends: 5701 [2025-03-16 15:05:25,037 INFO L226 Difference]: Without dead ends: 3207 [2025-03-16 15:05:25,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:25,040 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:25,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 238 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-03-16 15:05:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3207. [2025-03-16 15:05:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0786026200873362) internal successors, (3458), 3206 states have internal predecessors, (3458), 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-16 15:05:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3458 transitions. [2025-03-16 15:05:25,082 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3458 transitions. Word has length 592 [2025-03-16 15:05:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:25,083 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3458 transitions. [2025-03-16 15:05:25,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-16 15:05:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3458 transitions. [2025-03-16 15:05:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-16 15:05:25,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:25,086 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:05:25,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:25,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1529887305, now seen corresponding path program 1 times [2025-03-16 15:05:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:25,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168822564] [2025-03-16 15:05:25,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:25,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-16 15:05:25,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-16 15:05:25,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1084 proven. 104 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-16 15:05:25,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168822564] [2025-03-16 15:05:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168822564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621481605] [2025-03-16 15:05:25,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:25,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:25,558 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-16 15:05:25,560 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-16 15:05:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-16 15:05:25,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-16 15:05:25,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:25,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:25,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:05:25,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2025-03-16 15:05:25,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:05:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621481605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:25,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:05:25,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:05:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432094231] [2025-03-16 15:05:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:25,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:25,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:25,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:05:25,751 INFO L87 Difference]: Start difference. First operand 3207 states and 3458 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-16 15:05:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:26,108 INFO L93 Difference]: Finished difference Result 4455 states and 4792 transitions. [2025-03-16 15:05:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:26,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) Word has length 623 [2025-03-16 15:05:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:26,117 INFO L225 Difference]: With dead ends: 4455 [2025-03-16 15:05:26,117 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:05:26,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:05:26,119 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 156 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:26,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 10 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:05:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:05:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 3207. [2025-03-16 15:05:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0786026200873362) internal successors, (3458), 3206 states have internal predecessors, (3458), 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-16 15:05:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3458 transitions. [2025-03-16 15:05:26,157 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3458 transitions. Word has length 623 [2025-03-16 15:05:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:26,157 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3458 transitions. [2025-03-16 15:05:26,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-16 15:05:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3458 transitions. [2025-03-16 15:05:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-16 15:05:26,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:26,161 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:26,167 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-16 15:05:26,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:26,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:26,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1758773231, now seen corresponding path program 1 times [2025-03-16 15:05:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:26,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763773803] [2025-03-16 15:05:26,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:26,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-16 15:05:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-16 15:05:26,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:26,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:05:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763773803] [2025-03-16 15:05:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763773803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640018498] [2025-03-16 15:05:26,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:26,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:26,611 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-16 15:05:26,613 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-16 15:05:26,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-16 15:05:26,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-16 15:05:26,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:26,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:26,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:05:26,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:05:27,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:05:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:05:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640018498] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:05:27,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:05:27,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 15:05:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334049897] [2025-03-16 15:05:27,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:05:27,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:05:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:27,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:05:27,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:05:27,275 INFO L87 Difference]: Start difference. First operand 3207 states and 3458 transitions. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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-16 15:05:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:27,920 INFO L93 Difference]: Finished difference Result 7837 states and 8471 transitions. [2025-03-16 15:05:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:05:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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) Word has length 633 [2025-03-16 15:05:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:27,931 INFO L225 Difference]: With dead ends: 7837 [2025-03-16 15:05:27,931 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:05:27,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1268 GetRequests, 1264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:05:27,935 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 264 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:27,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 56 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:05:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:05:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 3919. [2025-03-16 15:05:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0737621235324144) internal successors, (4207), 3918 states have internal predecessors, (4207), 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-16 15:05:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4207 transitions. [2025-03-16 15:05:27,992 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4207 transitions. Word has length 633 [2025-03-16 15:05:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4207 transitions. [2025-03-16 15:05:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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-16 15:05:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4207 transitions. [2025-03-16 15:05:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-16 15:05:27,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:27,997 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:28,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:05:28,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:28,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:28,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash 921988962, now seen corresponding path program 1 times [2025-03-16 15:05:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:28,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176644210] [2025-03-16 15:05:28,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:28,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:28,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-16 15:05:28,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-16 15:05:28,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:28,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1111 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-03-16 15:05:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:28,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176644210] [2025-03-16 15:05:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176644210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:28,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262282384] [2025-03-16 15:05:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:28,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:28,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:28,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:28,479 INFO L87 Difference]: Start difference. First operand 3919 states and 4207 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-16 15:05:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:28,782 INFO L93 Difference]: Finished difference Result 8015 states and 8609 transitions. [2025-03-16 15:05:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:28,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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) Word has length 643 [2025-03-16 15:05:28,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:28,791 INFO L225 Difference]: With dead ends: 8015 [2025-03-16 15:05:28,791 INFO L226 Difference]: Without dead ends: 4275 [2025-03-16 15:05:28,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:28,794 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:28,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 241 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:05:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-16 15:05:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4275. [2025-03-16 15:05:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0652784277023866) internal successors, (4553), 4274 states have internal predecessors, (4553), 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-16 15:05:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4553 transitions. [2025-03-16 15:05:28,831 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4553 transitions. Word has length 643 [2025-03-16 15:05:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:28,831 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4553 transitions. [2025-03-16 15:05:28,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-16 15:05:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4553 transitions. [2025-03-16 15:05:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2025-03-16 15:05:28,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:28,836 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:05:28,836 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:28,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1732474559, now seen corresponding path program 1 times [2025-03-16 15:05:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926345813] [2025-03-16 15:05:28,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:28,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 761 statements into 1 equivalence classes. [2025-03-16 15:05:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 761 of 761 statements. [2025-03-16 15:05:28,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:28,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 755 proven. 258 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-16 15:05:29,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:29,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926345813] [2025-03-16 15:05:29,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926345813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:29,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963720780] [2025-03-16 15:05:29,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:29,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:29,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:29,580 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-16 15:05:29,582 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-16 15:05:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 761 statements into 1 equivalence classes. [2025-03-16 15:05:29,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 761 of 761 statements. [2025-03-16 15:05:29,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:29,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:29,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:05:29,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2025-03-16 15:05:30,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:05:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963720780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:30,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:05:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-16 15:05:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704502738] [2025-03-16 15:05:30,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:30,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:05:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:30,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:05:30,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:05:30,389 INFO L87 Difference]: Start difference. First operand 4275 states and 4553 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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-16 15:05:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:30,871 INFO L93 Difference]: Finished difference Result 8905 states and 9507 transitions. [2025-03-16 15:05:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:30,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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) Word has length 761 [2025-03-16 15:05:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:30,879 INFO L225 Difference]: With dead ends: 8905 [2025-03-16 15:05:30,880 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 15:05:30,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:05:30,883 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 126 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:30,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 47 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:05:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 15:05:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4453. [2025-03-16 15:05:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0584007187780773) internal successors, (4712), 4452 states have internal predecessors, (4712), 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-16 15:05:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4712 transitions. [2025-03-16 15:05:30,918 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4712 transitions. Word has length 761 [2025-03-16 15:05:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:30,918 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4712 transitions. [2025-03-16 15:05:30,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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-16 15:05:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4712 transitions. [2025-03-16 15:05:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-03-16 15:05:30,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:30,923 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:30,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:05:31,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:05:31,124 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:31,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1077209462, now seen corresponding path program 1 times [2025-03-16 15:05:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900552998] [2025-03-16 15:05:31,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:31,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 800 statements into 1 equivalence classes. [2025-03-16 15:05:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 800 of 800 statements. [2025-03-16 15:05:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1166 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:05:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900552998] [2025-03-16 15:05:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900552998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37783026] [2025-03-16 15:05:31,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:31,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:31,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:31,993 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-16 15:05:31,994 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-16 15:05:32,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 800 statements into 1 equivalence classes. [2025-03-16 15:05:32,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 800 of 800 statements. [2025-03-16 15:05:32,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:32,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:05:32,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1302 proven. 489 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-16 15:05:32,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:05:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1238 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:05:33,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37783026] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:33,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:05:33,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10 [2025-03-16 15:05:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794731540] [2025-03-16 15:05:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:33,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:05:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:33,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:05:33,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:05:33,524 INFO L87 Difference]: Start difference. First operand 4453 states and 4712 transitions. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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-16 15:05:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:34,004 INFO L93 Difference]: Finished difference Result 9083 states and 9634 transitions. [2025-03-16 15:05:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:34,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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) Word has length 800 [2025-03-16 15:05:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:34,012 INFO L225 Difference]: With dead ends: 9083 [2025-03-16 15:05:34,013 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:05:34,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1603 GetRequests, 1594 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:05:34,016 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 459 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:34,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 9 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:05:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2025-03-16 15:05:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0596112311015118) internal successors, (4906), 4630 states have internal predecessors, (4906), 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-16 15:05:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4906 transitions. [2025-03-16 15:05:34,061 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4906 transitions. Word has length 800 [2025-03-16 15:05:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:34,061 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4906 transitions. [2025-03-16 15:05:34,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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-16 15:05:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4906 transitions. [2025-03-16 15:05:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-16 15:05:34,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:34,066 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:34,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:05:34,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:05:34,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:34,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash -378799880, now seen corresponding path program 1 times [2025-03-16 15:05:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:34,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853204343] [2025-03-16 15:05:34,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:34,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-16 15:05:34,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-16 15:05:34,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:34,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1202 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:05:35,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:35,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853204343] [2025-03-16 15:05:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853204343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40345875] [2025-03-16 15:05:35,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:35,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:35,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:35,119 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-16 15:05:35,120 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-16 15:05:35,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-16 15:05:35,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-16 15:05:35,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:35,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:35,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:05:35,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1305 proven. 522 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-16 15:05:35,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:05:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1274 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:05:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40345875] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:36,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:05:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10 [2025-03-16 15:05:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185853257] [2025-03-16 15:05:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:36,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:05:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:36,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:05:36,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:05:36,488 INFO L87 Difference]: Start difference. First operand 4631 states and 4906 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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-16 15:05:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:36,903 INFO L93 Difference]: Finished difference Result 9439 states and 10002 transitions. [2025-03-16 15:05:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:36,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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) Word has length 833 [2025-03-16 15:05:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:36,911 INFO L225 Difference]: With dead ends: 9439 [2025-03-16 15:05:36,911 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:05:36,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1669 GetRequests, 1660 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:05:36,914 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 327 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:36,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 9 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:05:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4809. [2025-03-16 15:05:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.057820299500832) internal successors, (5086), 4808 states have internal predecessors, (5086), 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-16 15:05:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5086 transitions. [2025-03-16 15:05:36,951 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5086 transitions. Word has length 833 [2025-03-16 15:05:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:36,952 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5086 transitions. [2025-03-16 15:05:36,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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-16 15:05:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5086 transitions. [2025-03-16 15:05:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2025-03-16 15:05:36,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:36,958 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:36,965 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-16 15:05:37,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:37,159 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1660445187, now seen corresponding path program 1 times [2025-03-16 15:05:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:37,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485711069] [2025-03-16 15:05:37,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:37,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-16 15:05:37,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-16 15:05:37,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:37,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1049 proven. 325 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-03-16 15:05:37,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:37,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485711069] [2025-03-16 15:05:37,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485711069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:37,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619850382] [2025-03-16 15:05:37,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:37,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:37,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:37,847 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-16 15:05:37,848 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-16 15:05:37,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-16 15:05:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-16 15:05:38,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:38,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:38,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:05:38,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1240 proven. 0 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2025-03-16 15:05:39,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:05:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619850382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:05:39,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:05:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052430484] [2025-03-16 15:05:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:39,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:05:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:39,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:05:39,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:05:39,858 INFO L87 Difference]: Start difference. First operand 4809 states and 5086 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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-16 15:05:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:40,243 INFO L93 Difference]: Finished difference Result 9646 states and 10207 transitions. [2025-03-16 15:05:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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) Word has length 899 [2025-03-16 15:05:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:40,251 INFO L225 Difference]: With dead ends: 9646 [2025-03-16 15:05:40,251 INFO L226 Difference]: Without dead ends: 5016 [2025-03-16 15:05:40,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:05:40,255 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 101 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:40,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 49 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:05:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5016 states. [2025-03-16 15:05:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5016 to 4809. [2025-03-16 15:05:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0515806988352745) internal successors, (5056), 4808 states have internal predecessors, (5056), 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-16 15:05:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5056 transitions. [2025-03-16 15:05:40,300 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5056 transitions. Word has length 899 [2025-03-16 15:05:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:40,300 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5056 transitions. [2025-03-16 15:05:40,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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-16 15:05:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5056 transitions. [2025-03-16 15:05:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2025-03-16 15:05:40,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:40,308 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:40,316 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-16 15:05:40,510 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,SelfDestructingSolverStorable17 [2025-03-16 15:05:40,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash 947887876, now seen corresponding path program 1 times [2025-03-16 15:05:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739960352] [2025-03-16 15:05:40,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:40,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1039 statements into 1 equivalence classes. [2025-03-16 15:05:40,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1039 of 1039 statements. [2025-03-16 15:05:40,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:40,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3573 backedges. 1104 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-03-16 15:05:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739960352] [2025-03-16 15:05:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739960352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:40,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:40,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937146675] [2025-03-16 15:05:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:40,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:40,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:40,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:40,816 INFO L87 Difference]: Start difference. First operand 4809 states and 5056 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-16 15:05:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:41,123 INFO L93 Difference]: Finished difference Result 9971 states and 10497 transitions. [2025-03-16 15:05:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) Word has length 1039 [2025-03-16 15:05:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:41,124 INFO L225 Difference]: With dead ends: 9971 [2025-03-16 15:05:41,124 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:05:41,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:41,128 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:41,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 213 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:05:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:05:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:05:41,129 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-16 15:05:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:05:41,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1039 [2025-03-16 15:05:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:41,129 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:05:41,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-16 15:05:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:05:41,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:05:41,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:05:41,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:05:41,134 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:41,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:05:41,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:05:41,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:05:41 BoogieIcfgContainer [2025-03-16 15:05:41,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:05:41,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:05:41,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:05:41,653 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:05:41,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:05:15" (3/4) ... [2025-03-16 15:05:41,655 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:05:41,673 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:05:41,677 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:05:41,677 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:05:41,678 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:05:41,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:05:41,793 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:05:41,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:05:41,793 INFO L158 Benchmark]: Toolchain (without parser) took 28457.51ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 103.3MB in the beginning and 55.6MB in the end (delta: 47.7MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2025-03-16 15:05:41,794 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:05:41,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.85ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 71.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:05:41,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.96ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 60.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:05:41,795 INFO L158 Benchmark]: Boogie Preprocessor took 105.95ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 49.2MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:05:41,795 INFO L158 Benchmark]: IcfgBuilder took 1108.03ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 66.8MB in the end (delta: -17.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2025-03-16 15:05:41,795 INFO L158 Benchmark]: TraceAbstraction took 26621.77ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 65.9MB in the beginning and 67.9MB in the end (delta: -2.0MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2025-03-16 15:05:41,795 INFO L158 Benchmark]: Witness Printer took 140.67ms. Allocated memory is still 201.3MB. Free memory was 67.9MB in the beginning and 55.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:05:41,797 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.85ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 71.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.96ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 60.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.95ms. Allocated memory is still 142.6MB. Free memory was 60.1MB in the beginning and 49.2MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1108.03ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 66.8MB in the end (delta: -17.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 26621.77ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 65.9MB in the beginning and 67.9MB in the end (delta: -2.0MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. * Witness Printer took 140.67ms. Allocated memory is still 201.3MB. Free memory was 67.9MB in the beginning and 55.6MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. 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: 149]: 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 1 procedures, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2938 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2938 mSDsluCounter, 2067 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 1344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9921 IncrementalHoareTripleChecker+Invalid, 11265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1344 mSolverCounterUnsat, 1973 mSDtfsCounter, 9921 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7515 GetRequests, 7453 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4809occurred in iteration=17, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 4835 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 14760 NumberOfCodeBlocks, 14760 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 16996 ConstructedInterpolants, 230 QuantifiedInterpolants, 60946 SizeOfPredicates, 2 NumberOfNonLiveVariables, 6528 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 36471/38850 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 - InvariantResult [Line: 890]: Location Invariant Derived location invariant: ((((((((a12 <= 11) && (a24 == 1)) && (0 <= ((long long) a12 + 42))) || (((((long long) a12 + 43) <= 0) && (a24 == 1)) && (10 <= a21))) || (((a24 == 1) && (81 <= a12)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 545667))) || ((((a12 <= 80) && (a24 == 1)) && (a15 <= 8)) && ((5 < a15) || (a21 != 6)))) || (((a21 == 8) && (a24 == 1)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 545667))) || (((a12 <= 11) && (a15 <= 8)) && (a21 <= 6))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:05:41,814 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