./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_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/Problem16_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 94406c90b46fed2ba639405486e012fa4ad77124178cc3ef79a472c538020bbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:12:05,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:12:05,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:12:05,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:12:05,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:12:05,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:12:05,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:12:05,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:12:05,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:12:05,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:12:05,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:12:05,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:12:05,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:12:05,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:12:05,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:12:05,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:12:05,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:12:05,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:12:05,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:12:05,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:12:05,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:12:05,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:12:05,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:12:05,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:12:05,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:12:05,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:12:05,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:12:05,361 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 -> 94406c90b46fed2ba639405486e012fa4ad77124178cc3ef79a472c538020bbf [2025-03-16 15:12:05,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:12:05,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:12:05,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:12:05,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:12:05,611 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:12:05,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label09.c [2025-03-16 15:12:06,734 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031c83c9f/a06046d17eee485baab3e477ea07bcda/FLAGbd71d56bb [2025-03-16 15:12:07,124 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:12:07,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c [2025-03-16 15:12:07,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031c83c9f/a06046d17eee485baab3e477ea07bcda/FLAGbd71d56bb [2025-03-16 15:12:07,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031c83c9f/a06046d17eee485baab3e477ea07bcda [2025-03-16 15:12:07,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:12:07,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:12:07,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:12:07,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:12:07,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:12:07,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:07,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07, skipping insertion in model container [2025-03-16 15:12:07,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:07,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:12:07,534 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/Problem16_label09.c[5013,5026] [2025-03-16 15:12:07,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:12:07,804 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:12:07,818 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/Problem16_label09.c[5013,5026] [2025-03-16 15:12:07,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:12:07,942 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:12:07,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07 WrapperNode [2025-03-16 15:12:07,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:12:07,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:12:07,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:12:07,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:12:07,948 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:12:07" (1/1) ... [2025-03-16 15:12:07,966 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:12:07" (1/1) ... [2025-03-16 15:12:08,041 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:12:08,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:12:08,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:12:08,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:12:08,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:12:08,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,147 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:12:08,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:12:08,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:12:08,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:12:08,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:12:08,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (1/1) ... [2025-03-16 15:12:08,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:12:08,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:08,250 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:12:08,253 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:12:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:12:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:12:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:12:08,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:12:08,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:12:08,313 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:12:09,755 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:12:09,825 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:12:09,826 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:12:09,845 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:12:09,847 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:12:09,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:09 BoogieIcfgContainer [2025-03-16 15:12:09,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:12:09,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:12:09,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:12:09,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:12:09,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:12:07" (1/3) ... [2025-03-16 15:12:09,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cdc2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:12:09, skipping insertion in model container [2025-03-16 15:12:09,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:07" (2/3) ... [2025-03-16 15:12:09,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cdc2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:12:09, skipping insertion in model container [2025-03-16 15:12:09,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:09" (3/3) ... [2025-03-16 15:12:09,855 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label09.c [2025-03-16 15:12:09,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:12:09,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label09.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:12:09,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:12:09,937 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;@22287d8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:12:09,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:12:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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:12:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 15:12:09,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:09,948 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, 1, 1] [2025-03-16 15:12:09,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:09,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1406306896, now seen corresponding path program 1 times [2025-03-16 15:12:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:09,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462595144] [2025-03-16 15:12:09,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 15:12:10,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 15:12:10,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:10,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:10,083 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:12:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:10,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462595144] [2025-03-16 15:12:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462595144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:10,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144598832] [2025-03-16 15:12:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:10,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:12:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:10,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:12:10,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:12:10,103 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:12:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:10,151 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:12:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:12:10,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2025-03-16 15:12:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:10,162 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:12:10,163 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:12:10,167 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:12:10,170 INFO L435 NwaCegarLoop]: 599 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, 599 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:12:10,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:12:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:12:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:12:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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:12:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:12:10,226 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 46 [2025-03-16 15:12:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:10,227 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:12:10,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:12:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:12:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 15:12:10,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:10,228 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, 1, 1] [2025-03-16 15:12:10,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:12:10,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:10,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash 993351409, now seen corresponding path program 1 times [2025-03-16 15:12:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502047482] [2025-03-16 15:12:10,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:10,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 15:12:10,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 15:12:10,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:10,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:10,434 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:12:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502047482] [2025-03-16 15:12:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502047482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:10,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136789645] [2025-03-16 15:12:10,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:10,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:10,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:10,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:10,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:10,439 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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:12:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:11,775 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:12:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2025-03-16 15:12:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:11,778 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:12:11,778 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:12:11,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:12:11,783 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 324 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:11,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 200 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:12:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:12:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:12:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 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:12:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2025-03-16 15:12:11,812 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 46 [2025-03-16 15:12:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:11,812 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2025-03-16 15:12:11,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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:12:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2025-03-16 15:12:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 15:12:11,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:11,814 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, 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] [2025-03-16 15:12:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:12:11,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1071582043, now seen corresponding path program 1 times [2025-03-16 15:12:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122634485] [2025-03-16 15:12:11,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:11,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 15:12:11,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 15:12:11,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:11,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122634485] [2025-03-16 15:12:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122634485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:12,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821030257] [2025-03-16 15:12:12,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:12,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:12,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:12,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:12,113 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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:12:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:13,728 INFO L93 Difference]: Finished difference Result 2308 states and 3413 transitions. [2025-03-16 15:12:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:13,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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 114 [2025-03-16 15:12:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:13,736 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 15:12:13,736 INFO L226 Difference]: Without dead ends: 1648 [2025-03-16 15:12:13,741 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:12:13,741 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1007 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:13,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 41 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:12:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-16 15:12:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2025-03-16 15:12:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4019429265330905) internal successors, (2309), 1647 states have internal predecessors, (2309), 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:12:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2309 transitions. [2025-03-16 15:12:13,782 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2309 transitions. Word has length 114 [2025-03-16 15:12:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2309 transitions. [2025-03-16 15:12:13,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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:12:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2309 transitions. [2025-03-16 15:12:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 15:12:13,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:13,789 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, 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, 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:12:13,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:12:13,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:13,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:13,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2052937739, now seen corresponding path program 1 times [2025-03-16 15:12:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159907004] [2025-03-16 15:12:13,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:13,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 15:12:13,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 15:12:13,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:13,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159907004] [2025-03-16 15:12:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159907004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:13,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084798975] [2025-03-16 15:12:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:13,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:13,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:13,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:13,962 INFO L87 Difference]: Start difference. First operand 1648 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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:12:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:14,978 INFO L93 Difference]: Finished difference Result 3624 states and 5241 transitions. [2025-03-16 15:12:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:14,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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 177 [2025-03-16 15:12:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:14,985 INFO L225 Difference]: With dead ends: 3624 [2025-03-16 15:12:14,985 INFO L226 Difference]: Without dead ends: 2306 [2025-03-16 15:12:14,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:12:14,987 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:14,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 76 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:12:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-16 15:12:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2025-03-16 15:12:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.350108459869848) internal successors, (3112), 2305 states have internal predecessors, (3112), 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:12:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3112 transitions. [2025-03-16 15:12:15,020 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3112 transitions. Word has length 177 [2025-03-16 15:12:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:15,021 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3112 transitions. [2025-03-16 15:12:15,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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:12:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3112 transitions. [2025-03-16 15:12:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 15:12:15,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:15,023 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:15,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:12:15,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:15,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1776520995, now seen corresponding path program 1 times [2025-03-16 15:12:15,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:15,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232488803] [2025-03-16 15:12:15,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:15,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:15,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 15:12:15,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 15:12:15,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:15,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:12:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232488803] [2025-03-16 15:12:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232488803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120405381] [2025-03-16 15:12:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:15,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:15,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:15,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:15,183 INFO L87 Difference]: Start difference. First operand 2306 states and 3112 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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:12:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:16,207 INFO L93 Difference]: Finished difference Result 5598 states and 7698 transitions. [2025-03-16 15:12:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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 212 [2025-03-16 15:12:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:16,217 INFO L225 Difference]: With dead ends: 5598 [2025-03-16 15:12:16,218 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:12:16,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:12:16,221 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:16,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 154 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:12:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:12:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 2964. [2025-03-16 15:12:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2963 states have (on average 1.2443469456631793) internal successors, (3687), 2963 states have internal predecessors, (3687), 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:12:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 3687 transitions. [2025-03-16 15:12:16,271 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 3687 transitions. Word has length 212 [2025-03-16 15:12:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:16,272 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 3687 transitions. [2025-03-16 15:12:16,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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:12:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3687 transitions. [2025-03-16 15:12:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 15:12:16,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:16,274 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:16,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:12:16,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:16,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1336446377, now seen corresponding path program 1 times [2025-03-16 15:12:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202365521] [2025-03-16 15:12:16,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:16,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 15:12:16,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 15:12:16,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:16,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:16,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:16,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202365521] [2025-03-16 15:12:16,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202365521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:16,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943440130] [2025-03-16 15:12:16,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:16,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:16,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:16,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:16,416 INFO L87 Difference]: Start difference. First operand 2964 states and 3687 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:12:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:17,342 INFO L93 Difference]: Finished difference Result 6914 states and 8656 transitions. [2025-03-16 15:12:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:17,343 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 229 [2025-03-16 15:12:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:17,353 INFO L225 Difference]: With dead ends: 6914 [2025-03-16 15:12:17,353 INFO L226 Difference]: Without dead ends: 3951 [2025-03-16 15:12:17,356 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:12:17,357 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 287 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:17,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 537 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:12:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-16 15:12:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2025-03-16 15:12:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.0736708860759494) internal successors, (4241), 3950 states have internal predecessors, (4241), 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:12:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4241 transitions. [2025-03-16 15:12:17,408 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4241 transitions. Word has length 229 [2025-03-16 15:12:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:17,408 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4241 transitions. [2025-03-16 15:12:17,408 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:12:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4241 transitions. [2025-03-16 15:12:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 15:12:17,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:17,410 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, 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, 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, 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:12:17,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:12:17,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:17,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1006932081, now seen corresponding path program 1 times [2025-03-16 15:12:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895050062] [2025-03-16 15:12:17,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:17,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 15:12:17,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 15:12:17,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:17,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895050062] [2025-03-16 15:12:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895050062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055358078] [2025-03-16 15:12:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:17,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:17,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:17,608 INFO L87 Difference]: Start difference. First operand 3951 states and 4241 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:12:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:18,249 INFO L93 Difference]: Finished difference Result 9217 states and 9925 transitions. [2025-03-16 15:12:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 281 [2025-03-16 15:12:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:18,260 INFO L225 Difference]: With dead ends: 9217 [2025-03-16 15:12:18,261 INFO L226 Difference]: Without dead ends: 5267 [2025-03-16 15:12:18,265 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:12:18,265 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 295 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:18,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 69 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2025-03-16 15:12:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 5267. [2025-03-16 15:12:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 5266 states have (on average 1.0626661602734524) internal successors, (5596), 5266 states have internal predecessors, (5596), 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:12:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 5596 transitions. [2025-03-16 15:12:18,323 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 5596 transitions. Word has length 281 [2025-03-16 15:12:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:18,324 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 5596 transitions. [2025-03-16 15:12:18,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:12:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 5596 transitions. [2025-03-16 15:12:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-16 15:12:18,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:18,327 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, 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, 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, 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, 1, 1, 1, 1] [2025-03-16 15:12:18,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:12:18,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:18,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash -713607927, now seen corresponding path program 1 times [2025-03-16 15:12:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:18,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748992976] [2025-03-16 15:12:18,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:18,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:18,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-16 15:12:18,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-16 15:12:18,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:18,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:12:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748992976] [2025-03-16 15:12:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748992976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273992199] [2025-03-16 15:12:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:18,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:18,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:18,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:18,730 INFO L87 Difference]: Start difference. First operand 5267 states and 5596 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 2 states have internal predecessors, (283), 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:12:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:19,516 INFO L93 Difference]: Finished difference Result 14481 states and 15443 transitions. [2025-03-16 15:12:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:19,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 2 states have internal predecessors, (283), 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 377 [2025-03-16 15:12:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:19,538 INFO L225 Difference]: With dead ends: 14481 [2025-03-16 15:12:19,538 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:12:19,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:12:19,544 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 97 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:19,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 63 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:12:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:12:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:12:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.062730627306273) internal successors, (9792), 9214 states have internal predecessors, (9792), 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:12:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9792 transitions. [2025-03-16 15:12:19,676 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9792 transitions. Word has length 377 [2025-03-16 15:12:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:19,676 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9792 transitions. [2025-03-16 15:12:19,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 2 states have internal predecessors, (283), 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:12:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9792 transitions. [2025-03-16 15:12:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-16 15:12:19,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:19,683 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:19,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:12:19,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:19,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1246320029, now seen corresponding path program 1 times [2025-03-16 15:12:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289764276] [2025-03-16 15:12:19,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:19,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-16 15:12:19,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-16 15:12:19,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:19,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-16 15:12:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289764276] [2025-03-16 15:12:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289764276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912368837] [2025-03-16 15:12:20,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:20,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:20,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:20,043 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:12:20,045 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:12:20,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-16 15:12:20,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-16 15:12:20,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:20,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:20,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:12:20,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-16 15:12:20,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912368837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:20,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:20,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:12:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072220677] [2025-03-16 15:12:20,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:20,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:20,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:20,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:12:20,584 INFO L87 Difference]: Start difference. First operand 9215 states and 9792 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 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:12:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:21,221 INFO L93 Difference]: Finished difference Result 10862 states and 11487 transitions. [2025-03-16 15:12:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:21,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 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 385 [2025-03-16 15:12:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:21,269 INFO L225 Difference]: With dead ends: 10862 [2025-03-16 15:12:21,270 INFO L226 Difference]: Without dead ends: 10860 [2025-03-16 15:12:21,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 384 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:12:21,272 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:21,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 76 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2025-03-16 15:12:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 9544. [2025-03-16 15:12:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9544 states, 9543 states have (on average 1.0619302106255895) internal successors, (10134), 9543 states have internal predecessors, (10134), 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:12:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9544 states to 9544 states and 10134 transitions. [2025-03-16 15:12:21,352 INFO L78 Accepts]: Start accepts. Automaton has 9544 states and 10134 transitions. Word has length 385 [2025-03-16 15:12:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:21,352 INFO L471 AbstractCegarLoop]: Abstraction has 9544 states and 10134 transitions. [2025-03-16 15:12:21,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 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:12:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9544 states and 10134 transitions. [2025-03-16 15:12:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-03-16 15:12:21,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:21,364 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:21,371 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:12:21,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:21,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1631581472, now seen corresponding path program 1 times [2025-03-16 15:12:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350370758] [2025-03-16 15:12:21,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:21,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-03-16 15:12:21,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-03-16 15:12:21,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:21,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 907 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 15:12:22,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:22,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350370758] [2025-03-16 15:12:22,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350370758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:22,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:22,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650095211] [2025-03-16 15:12:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:22,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:22,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:22,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:22,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:22,098 INFO L87 Difference]: Start difference. First operand 9544 states and 10134 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:12:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:22,824 INFO L93 Difference]: Finished difference Result 21719 states and 23139 transitions. [2025-03-16 15:12:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:22,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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 700 [2025-03-16 15:12:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:22,842 INFO L225 Difference]: With dead ends: 21719 [2025-03-16 15:12:22,842 INFO L226 Difference]: Without dead ends: 12505 [2025-03-16 15:12:22,848 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:12:22,849 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:22,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 35 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:12:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2025-03-16 15:12:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12176. [2025-03-16 15:12:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12175 states have (on average 1.0625872689938398) internal successors, (12937), 12175 states have internal predecessors, (12937), 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:12:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 12937 transitions. [2025-03-16 15:12:22,945 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 12937 transitions. Word has length 700 [2025-03-16 15:12:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:22,946 INFO L471 AbstractCegarLoop]: Abstraction has 12176 states and 12937 transitions. [2025-03-16 15:12:22,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:12:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 12937 transitions. [2025-03-16 15:12:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2025-03-16 15:12:22,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:22,960 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, 6, 6, 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, 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, 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, 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] [2025-03-16 15:12:22,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:12:22,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:22,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1897656989, now seen corresponding path program 1 times [2025-03-16 15:12:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:22,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267485966] [2025-03-16 15:12:22,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:22,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-03-16 15:12:23,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-03-16 15:12:23,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 15:12:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:23,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267485966] [2025-03-16 15:12:23,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267485966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:23,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:23,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822590434] [2025-03-16 15:12:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:23,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:23,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:23,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:23,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:23,539 INFO L87 Difference]: Start difference. First operand 12176 states and 12937 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 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:12:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:24,130 INFO L93 Difference]: Finished difference Result 24351 states and 25879 transitions. [2025-03-16 15:12:24,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:24,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 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 781 [2025-03-16 15:12:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:24,149 INFO L225 Difference]: With dead ends: 24351 [2025-03-16 15:12:24,149 INFO L226 Difference]: Without dead ends: 12505 [2025-03-16 15:12:24,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:12:24,160 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:24,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 103 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2025-03-16 15:12:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12505. [2025-03-16 15:12:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0615003198976327) internal successors, (13273), 12504 states have internal predecessors, (13273), 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:12:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 13273 transitions. [2025-03-16 15:12:24,268 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 13273 transitions. Word has length 781 [2025-03-16 15:12:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:24,269 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 13273 transitions. [2025-03-16 15:12:24,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 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:12:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 13273 transitions. [2025-03-16 15:12:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-16 15:12:24,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:24,277 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, 6, 6, 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, 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, 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, 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] [2025-03-16 15:12:24,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:12:24,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:24,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1049903409, now seen corresponding path program 1 times [2025-03-16 15:12:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:24,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996135910] [2025-03-16 15:12:24,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:24,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:24,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-16 15:12:24,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-16 15:12:24,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:24,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 766 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-16 15:12:24,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996135910] [2025-03-16 15:12:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996135910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:24,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:24,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770321986] [2025-03-16 15:12:24,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:24,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:24,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:24,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:24,709 INFO L87 Difference]: Start difference. First operand 12505 states and 13273 transitions. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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:12:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:25,286 INFO L93 Difference]: Finished difference Result 27641 states and 29411 transitions. [2025-03-16 15:12:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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 789 [2025-03-16 15:12:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:25,302 INFO L225 Difference]: With dead ends: 27641 [2025-03-16 15:12:25,302 INFO L226 Difference]: Without dead ends: 15466 [2025-03-16 15:12:25,311 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:12:25,312 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:25,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 433 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2025-03-16 15:12:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 14808. [2025-03-16 15:12:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.054771391909232) internal successors, (15618), 14807 states have internal predecessors, (15618), 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:12:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15618 transitions. [2025-03-16 15:12:25,456 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15618 transitions. Word has length 789 [2025-03-16 15:12:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:25,457 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15618 transitions. [2025-03-16 15:12:25,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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:12:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15618 transitions. [2025-03-16 15:12:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-16 15:12:25,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:25,468 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, 6, 6, 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, 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, 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, 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] [2025-03-16 15:12:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:12:25,468 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1545640395, now seen corresponding path program 1 times [2025-03-16 15:12:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492329298] [2025-03-16 15:12:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:25,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-16 15:12:25,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-16 15:12:25,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:25,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-03-16 15:12:25,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492329298] [2025-03-16 15:12:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492329298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:25,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:25,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:25,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275364622] [2025-03-16 15:12:25,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:25,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:25,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:25,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:25,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:25,769 INFO L87 Difference]: Start difference. First operand 14808 states and 15618 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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:12:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:26,382 INFO L93 Difference]: Finished difference Result 29286 states and 30905 transitions. [2025-03-16 15:12:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 790 [2025-03-16 15:12:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:26,402 INFO L225 Difference]: With dead ends: 29286 [2025-03-16 15:12:26,402 INFO L226 Difference]: Without dead ends: 15137 [2025-03-16 15:12:26,414 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:12:26,415 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 253 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:26,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 423 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2025-03-16 15:12:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 15137. [2025-03-16 15:12:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 1.046049154334038) internal successors, (15833), 15136 states have internal predecessors, (15833), 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:12:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 15833 transitions. [2025-03-16 15:12:26,573 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 15833 transitions. Word has length 790 [2025-03-16 15:12:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:26,574 INFO L471 AbstractCegarLoop]: Abstraction has 15137 states and 15833 transitions. [2025-03-16 15:12:26,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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:12:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 15833 transitions. [2025-03-16 15:12:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2025-03-16 15:12:26,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:26,583 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, 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, 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, 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, 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] [2025-03-16 15:12:26,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:12:26,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash 785409406, now seen corresponding path program 1 times [2025-03-16 15:12:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:26,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534241373] [2025-03-16 15:12:26,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:26,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-03-16 15:12:26,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-03-16 15:12:26,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 248 proven. 554 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-16 15:12:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:27,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534241373] [2025-03-16 15:12:27,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534241373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:12:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115787553] [2025-03-16 15:12:27,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:27,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:12:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:27,329 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:12:27,331 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:12:27,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-03-16 15:12:27,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-03-16 15:12:27,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:27,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:27,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:12:27,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:12:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2025-03-16 15:12:27,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:12:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115787553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:12:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:12:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852245078] [2025-03-16 15:12:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:27,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:27,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:27,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:27,702 INFO L87 Difference]: Start difference. First operand 15137 states and 15833 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:12:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:28,268 INFO L93 Difference]: Finished difference Result 29615 states and 30998 transitions. [2025-03-16 15:12:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:28,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 804 [2025-03-16 15:12:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:28,282 INFO L225 Difference]: With dead ends: 29615 [2025-03-16 15:12:28,283 INFO L226 Difference]: Without dead ends: 15137 [2025-03-16 15:12:28,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:12:28,291 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 285 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:28,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 375 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2025-03-16 15:12:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 13821. [2025-03-16 15:12:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.039507959479016) internal successors, (14366), 13820 states have internal predecessors, (14366), 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:12:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14366 transitions. [2025-03-16 15:12:28,402 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14366 transitions. Word has length 804 [2025-03-16 15:12:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:28,403 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14366 transitions. [2025-03-16 15:12:28,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:12:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14366 transitions. [2025-03-16 15:12:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2025-03-16 15:12:28,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:28,417 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, 8, 8, 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, 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:28,426 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:12:28,618 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,SelfDestructingSolverStorable13 [2025-03-16 15:12:28,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -288264700, now seen corresponding path program 1 times [2025-03-16 15:12:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:28,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772476992] [2025-03-16 15:12:28,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:28,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1198 statements into 1 equivalence classes. [2025-03-16 15:12:28,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1198 of 1198 statements. [2025-03-16 15:12:28,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:28,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 2019 proven. 0 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2025-03-16 15:12:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772476992] [2025-03-16 15:12:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772476992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:29,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:29,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291084078] [2025-03-16 15:12:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:29,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:29,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:29,117 INFO L87 Difference]: Start difference. First operand 13821 states and 14366 transitions. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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:12:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:29,657 INFO L93 Difference]: Finished difference Result 26983 states and 28064 transitions. [2025-03-16 15:12:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:29,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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 1198 [2025-03-16 15:12:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:29,669 INFO L225 Difference]: With dead ends: 26983 [2025-03-16 15:12:29,670 INFO L226 Difference]: Without dead ends: 13492 [2025-03-16 15:12:29,677 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:12:29,678 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 193 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:29,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 423 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2025-03-16 15:12:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 12834. [2025-03-16 15:12:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.030078703342944) internal successors, (13219), 12833 states have internal predecessors, (13219), 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:12:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13219 transitions. [2025-03-16 15:12:29,810 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13219 transitions. Word has length 1198 [2025-03-16 15:12:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:29,810 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13219 transitions. [2025-03-16 15:12:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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:12:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13219 transitions. [2025-03-16 15:12:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2025-03-16 15:12:29,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:29,823 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, 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, 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, 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, 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, 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:12:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:12:29,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:29,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1543344602, now seen corresponding path program 1 times [2025-03-16 15:12:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:29,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278826396] [2025-03-16 15:12:29,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:29,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1208 statements into 1 equivalence classes. [2025-03-16 15:12:29,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1208 of 1208 statements. [2025-03-16 15:12:29,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:29,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2357 backedges. 1689 proven. 0 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2025-03-16 15:12:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278826396] [2025-03-16 15:12:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278826396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:30,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:12:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427219532] [2025-03-16 15:12:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:30,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:30,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:30,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:30,878 INFO L87 Difference]: Start difference. First operand 12834 states and 13219 transitions. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 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:12:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:31,710 INFO L93 Difference]: Finished difference Result 25018 states and 25779 transitions. [2025-03-16 15:12:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:12:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 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 1208 [2025-03-16 15:12:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:31,722 INFO L225 Difference]: With dead ends: 25018 [2025-03-16 15:12:31,722 INFO L226 Difference]: Without dead ends: 12843 [2025-03-16 15:12:31,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:12:31,731 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 218 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:31,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 440 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12843 states. [2025-03-16 15:12:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12843 to 12834. [2025-03-16 15:12:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0299228551390944) internal successors, (13217), 12833 states have internal predecessors, (13217), 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:12:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13217 transitions. [2025-03-16 15:12:31,870 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13217 transitions. Word has length 1208 [2025-03-16 15:12:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:31,871 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13217 transitions. [2025-03-16 15:12:31,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 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:12:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13217 transitions. [2025-03-16 15:12:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2025-03-16 15:12:31,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:31,894 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, 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, 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:31,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:12:31,894 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:31,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash 265348705, now seen corresponding path program 1 times [2025-03-16 15:12:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:31,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680778050] [2025-03-16 15:12:31,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:31,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-03-16 15:12:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-03-16 15:12:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:32,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3027 backedges. 1685 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2025-03-16 15:12:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680778050] [2025-03-16 15:12:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680778050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340127499] [2025-03-16 15:12:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:32,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:32,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:32,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:32,711 INFO L87 Difference]: Start difference. First operand 12834 states and 13217 transitions. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 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:12:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:33,222 INFO L93 Difference]: Finished difference Result 25667 states and 26435 transitions. [2025-03-16 15:12:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:33,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 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 1223 [2025-03-16 15:12:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:33,234 INFO L225 Difference]: With dead ends: 25667 [2025-03-16 15:12:33,234 INFO L226 Difference]: Without dead ends: 13492 [2025-03-16 15:12:33,242 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:12:33,242 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:33,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 436 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2025-03-16 15:12:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13492. [2025-03-16 15:12:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.0288340375064857) internal successors, (13880), 13491 states have internal predecessors, (13880), 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:12:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 13880 transitions. [2025-03-16 15:12:33,333 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 13880 transitions. Word has length 1223 [2025-03-16 15:12:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:33,333 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 13880 transitions. [2025-03-16 15:12:33,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 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:12:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 13880 transitions. [2025-03-16 15:12:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1249 [2025-03-16 15:12:33,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:33,347 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, 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, 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, 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, 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, 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] [2025-03-16 15:12:33,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:12:33,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:33,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash -74267924, now seen corresponding path program 1 times [2025-03-16 15:12:33,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:33,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837729914] [2025-03-16 15:12:33,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:33,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:33,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1248 statements into 1 equivalence classes. [2025-03-16 15:12:33,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1248 of 1248 statements. [2025-03-16 15:12:33,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:33,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 1814 proven. 0 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-03-16 15:12:34,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837729914] [2025-03-16 15:12:34,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837729914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:34,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:34,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:12:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799691610] [2025-03-16 15:12:34,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:34,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:34,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:34,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:34,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:34,210 INFO L87 Difference]: Start difference. First operand 13492 states and 13880 transitions. Second operand has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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:12:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:34,910 INFO L93 Difference]: Finished difference Result 26654 states and 27432 transitions. [2025-03-16 15:12:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:12:34,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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 1248 [2025-03-16 15:12:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:34,921 INFO L225 Difference]: With dead ends: 26654 [2025-03-16 15:12:34,921 INFO L226 Difference]: Without dead ends: 13821 [2025-03-16 15:12:34,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:12:34,928 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:34,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 560 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2025-03-16 15:12:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2025-03-16 15:12:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.02821997105644) internal successors, (14210), 13820 states have internal predecessors, (14210), 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:12:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14210 transitions. [2025-03-16 15:12:35,011 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14210 transitions. Word has length 1248 [2025-03-16 15:12:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:35,011 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14210 transitions. [2025-03-16 15:12:35,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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:12:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14210 transitions. [2025-03-16 15:12:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2025-03-16 15:12:35,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:35,023 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, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:35,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:12:35,023 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:35,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1290384682, now seen corresponding path program 1 times [2025-03-16 15:12:35,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:35,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581538078] [2025-03-16 15:12:35,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:35,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1277 statements into 1 equivalence classes. [2025-03-16 15:12:35,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1277 of 1277 statements. [2025-03-16 15:12:35,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:35,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3051 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 2737 trivial. 0 not checked. [2025-03-16 15:12:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581538078] [2025-03-16 15:12:35,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581538078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:35,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:35,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:35,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305504008] [2025-03-16 15:12:35,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:35,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:35,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:35,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:35,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:35,613 INFO L87 Difference]: Start difference. First operand 13821 states and 14210 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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:12:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:36,223 INFO L93 Difference]: Finished difference Result 28297 states and 29078 transitions. [2025-03-16 15:12:36,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:36,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 1277 [2025-03-16 15:12:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:36,225 INFO L225 Difference]: With dead ends: 28297 [2025-03-16 15:12:36,225 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:12:36,233 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:12:36,234 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 296 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:36,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 407 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:12:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:12:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:12:36,234 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:12:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:12:36,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1277 [2025-03-16 15:12:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:36,235 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:12:36,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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:12:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:12:36,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:12:36,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:12:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:12:36,240 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:12:36,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:12:36,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:12:36,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:12:36 BoogieIcfgContainer [2025-03-16 15:12:36,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:12:36,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:12:36,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:12:36,933 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:12:36,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:09" (3/4) ... [2025-03-16 15:12:36,934 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:12:36,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:12:36,960 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:12:36,962 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:12:36,963 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:12:37,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:12:37,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:12:37,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:12:37,090 INFO L158 Benchmark]: Toolchain (without parser) took 29772.45ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 119.0MB in the beginning and 1.0GB in the end (delta: -902.9MB). Peak memory consumption was 547.6MB. Max. memory is 16.1GB. [2025-03-16 15:12:37,090 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:12:37,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.38ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 60.7MB in the end (delta: 58.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 15:12:37,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.05ms. Allocated memory is still 167.8MB. Free memory was 60.7MB in the beginning and 37.5MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:12:37,091 INFO L158 Benchmark]: Boogie Preprocessor took 181.99ms. Allocated memory is still 167.8MB. Free memory was 37.5MB in the beginning and 79.7MB in the end (delta: -42.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-03-16 15:12:37,091 INFO L158 Benchmark]: IcfgBuilder took 1622.22ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 79.7MB in the beginning and 209.3MB in the end (delta: -129.6MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-03-16 15:12:37,092 INFO L158 Benchmark]: TraceAbstraction took 27082.28ms. Allocated memory was 335.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 208.0MB in the beginning and 1.0GB in the end (delta: -839.0MB). Peak memory consumption was 450.8MB. Max. memory is 16.1GB. [2025-03-16 15:12:37,092 INFO L158 Benchmark]: Witness Printer took 156.40ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:12:37,093 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.38ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 60.7MB in the end (delta: 58.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.05ms. Allocated memory is still 167.8MB. Free memory was 60.7MB in the beginning and 37.5MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 181.99ms. Allocated memory is still 167.8MB. Free memory was 37.5MB in the beginning and 79.7MB in the end (delta: -42.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1622.22ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 79.7MB in the beginning and 209.3MB in the end (delta: -129.6MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27082.28ms. Allocated memory was 335.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 208.0MB in the beginning and 1.0GB in the end (delta: -839.0MB). Peak memory consumption was 450.8MB. Max. memory is 16.1GB. * Witness Printer took 156.40ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 25.1MB). 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: 158]: 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, 335 locations, 661 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 19, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4871 SdHoareTripleChecker+Valid, 13.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4871 mSDsluCounter, 5450 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 2455 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15849 IncrementalHoareTripleChecker+Invalid, 18304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2455 mSolverCounterUnsat, 5232 mSDtfsCounter, 15849 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1247 GetRequests, 1218 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15137occurred in iteration=13, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 4944 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 13074 NumberOfCodeBlocks, 13074 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 13053 ConstructedInterpolants, 0 QuantifiedInterpolants, 31221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1430 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 21189/21779 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: 1783]: Location Invariant Derived location invariant: ((((((((((((((a16 == 9) && (7 == a12)) || (((a15 <= 3) && (((long long) 87 + a18) <= 0)) && (a12 <= 7))) || ((a12 == 9) && (a16 == 9))) || ((a16 <= 8) && (a12 == 9))) || (((a16 <= 8) && (a15 <= 3)) && (((long long) 87 + a18) <= 0))) || ((a16 <= 8) && (a12 == 8))) || ((a16 == 9) && (a12 == 8))) || ((a12 == 9) && (a15 <= 3))) || ((a15 <= 3) && (a12 == 8))) || (((a15 <= 3) && (11 <= a16)) && (7 == a12))) || (((a16 <= 8) && (4 <= a15)) && (7 == a12))) || ((a15 <= 3) && (a12 <= 6))) || ((a12 <= 6) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:12:37,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE