./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label59.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/Problem17_label59.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 9689a0609fceafc63efca466da3c77b2a75cad0dc813552287d39be336e7ab21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:21:48,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:21:48,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:21:48,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:21:48,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:21:48,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:21:48,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:21:48,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:21:48,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:21:48,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:21:48,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:21:48,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:21:48,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:21:48,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:21:48,902 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:21:48,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:21:48,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:21:48,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:21:48,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:21:48,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:21:48,904 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 -> 9689a0609fceafc63efca466da3c77b2a75cad0dc813552287d39be336e7ab21 [2025-03-16 15:21:49,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:21:49,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:21:49,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:21:49,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:21:49,123 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:21:49,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label59.c [2025-03-16 15:21:50,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57534f062/b4e5bb2a0fe54d0489c4c91c4971d5e5/FLAGd198eef2f [2025-03-16 15:21:50,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:21:50,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label59.c [2025-03-16 15:21:50,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57534f062/b4e5bb2a0fe54d0489c4c91c4971d5e5/FLAGd198eef2f [2025-03-16 15:21:50,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57534f062/b4e5bb2a0fe54d0489c4c91c4971d5e5 [2025-03-16 15:21:50,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:21:50,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:21:50,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:21:50,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:21:50,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:21:50,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:21:50" (1/1) ... [2025-03-16 15:21:50,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30909efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:50, skipping insertion in model container [2025-03-16 15:21:50,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:21:50" (1/1) ... [2025-03-16 15:21:50,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:21:50,982 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/Problem17_label59.c[4894,4907] [2025-03-16 15:21:51,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:21:51,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:21:51,408 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/Problem17_label59.c[4894,4907] [2025-03-16 15:21:51,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:21:51,629 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:21:51,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51 WrapperNode [2025-03-16 15:21:51,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:21:51,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:21:51,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:21:51,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:21:51,636 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:21:51" (1/1) ... [2025-03-16 15:21:51,664 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:21:51" (1/1) ... [2025-03-16 15:21:51,860 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:21:51,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:21:51,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:21:51,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:21:51,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:21:51,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:51,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:51,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,032 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:21:52,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:21:52,182 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:21:52,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:21:52,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:21:52,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (1/1) ... [2025-03-16 15:21:52,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:21:52,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:21:52,207 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:21:52,213 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:21:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:21:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:21:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:21:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:21:52,268 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:21:52,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:21:54,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:21:54,783 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:21:54,783 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:21:54,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:21:54,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:21:54,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:21:54 BoogieIcfgContainer [2025-03-16 15:21:54,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:21:54,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:21:54,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:21:54,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:21:54,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:21:50" (1/3) ... [2025-03-16 15:21:54,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316609b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:21:54, skipping insertion in model container [2025-03-16 15:21:54,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:21:51" (2/3) ... [2025-03-16 15:21:54,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316609b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:21:54, skipping insertion in model container [2025-03-16 15:21:54,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:21:54" (3/3) ... [2025-03-16 15:21:54,816 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label59.c [2025-03-16 15:21:54,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:21:54,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label59.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:21:54,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:21:54,907 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;@76eb5fbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:21:54,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:21:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 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:21:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 15:21:54,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:54,920 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] [2025-03-16 15:21:54,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:54,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1206598889, now seen corresponding path program 1 times [2025-03-16 15:21:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609103495] [2025-03-16 15:21:54,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:54,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 15:21:54,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 15:21:54,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:54,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:55,043 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:21:55,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:55,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609103495] [2025-03-16 15:21:55,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609103495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:55,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:55,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:21:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404101251] [2025-03-16 15:21:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:21:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:55,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:21:55,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:21:55,066 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:21:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:55,122 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:21:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:21:55,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2025-03-16 15:21:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:55,135 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:21:55,135 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:21:55,139 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:21:55,143 INFO L435 NwaCegarLoop]: 938 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, 938 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:21:55,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:21:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:21:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:21:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 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:21:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:21:55,200 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 31 [2025-03-16 15:21:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:55,200 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:21:55,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:21:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:21:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 15:21:55,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:55,201 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] [2025-03-16 15:21:55,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:21:55,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:55,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash -76384965, now seen corresponding path program 1 times [2025-03-16 15:21:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:55,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240491202] [2025-03-16 15:21:55,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:55,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 15:21:55,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 15:21:55,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:55,348 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:21:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240491202] [2025-03-16 15:21:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240491202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:21:55,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112932991] [2025-03-16 15:21:55,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:55,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:55,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:55,352 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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:21:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:57,288 INFO L93 Difference]: Finished difference Result 1535 states and 2741 transitions. [2025-03-16 15:21:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2025-03-16 15:21:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:57,292 INFO L225 Difference]: With dead ends: 1535 [2025-03-16 15:21:57,292 INFO L226 Difference]: Without dead ends: 1010 [2025-03-16 15:21:57,292 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:21:57,293 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 501 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:57,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 198 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:21:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-16 15:21:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 995. [2025-03-16 15:21:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.7364185110663983) internal successors, (1726), 994 states have internal predecessors, (1726), 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:21:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1726 transitions. [2025-03-16 15:21:57,316 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1726 transitions. Word has length 31 [2025-03-16 15:21:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:57,317 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1726 transitions. [2025-03-16 15:21:57,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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:21:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1726 transitions. [2025-03-16 15:21:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 15:21:57,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:57,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:57,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:21:57,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -196930218, now seen corresponding path program 1 times [2025-03-16 15:21:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707952538] [2025-03-16 15:21:57,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:57,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 15:21:57,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 15:21:57,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:57,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:21:57,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707952538] [2025-03-16 15:21:57,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707952538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:57,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:57,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:21:57,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215110349] [2025-03-16 15:21:57,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:57,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:57,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:57,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:57,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:57,560 INFO L87 Difference]: Start difference. First operand 995 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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:21:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:59,220 INFO L93 Difference]: Finished difference Result 2847 states and 4982 transitions. [2025-03-16 15:21:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:59,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2025-03-16 15:21:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:59,228 INFO L225 Difference]: With dead ends: 2847 [2025-03-16 15:21:59,229 INFO L226 Difference]: Without dead ends: 1853 [2025-03-16 15:21:59,233 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:21:59,234 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 394 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:59,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 588 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:21:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2025-03-16 15:21:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2025-03-16 15:21:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.402267818574514) internal successors, (2597), 1852 states have internal predecessors, (2597), 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:21:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2597 transitions. [2025-03-16 15:21:59,284 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2597 transitions. Word has length 96 [2025-03-16 15:21:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:59,284 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 2597 transitions. [2025-03-16 15:21:59,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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:21:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2597 transitions. [2025-03-16 15:21:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 15:21:59,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:59,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:21:59,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:59,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1733271905, now seen corresponding path program 1 times [2025-03-16 15:21:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072096396] [2025-03-16 15:21:59,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:59,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 15:21:59,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 15:21:59,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:21:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072096396] [2025-03-16 15:21:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072096396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:59,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276586096] [2025-03-16 15:21:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:59,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:59,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:59,512 INFO L87 Difference]: Start difference. First operand 1853 states and 2597 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:22:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:01,038 INFO L93 Difference]: Finished difference Result 5417 states and 7596 transitions. [2025-03-16 15:22:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-03-16 15:22:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:01,049 INFO L225 Difference]: With dead ends: 5417 [2025-03-16 15:22:01,049 INFO L226 Difference]: Without dead ends: 2712 [2025-03-16 15:22:01,052 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:22:01,053 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 475 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:01,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 872 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:22:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-03-16 15:22:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2709. [2025-03-16 15:22:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2708 states have (on average 1.2695716395864107) internal successors, (3438), 2708 states have internal predecessors, (3438), 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:22:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 3438 transitions. [2025-03-16 15:22:01,104 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 3438 transitions. Word has length 101 [2025-03-16 15:22:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:01,105 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 3438 transitions. [2025-03-16 15:22:01,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:22:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3438 transitions. [2025-03-16 15:22:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 15:22:01,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:01,113 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:22:01,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:22:01,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:01,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash -666126112, now seen corresponding path program 1 times [2025-03-16 15:22:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:01,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343576017] [2025-03-16 15:22:01,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:01,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 15:22:01,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 15:22:01,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:01,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:01,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343576017] [2025-03-16 15:22:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343576017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875307668] [2025-03-16 15:22:01,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:01,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:01,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:01,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:01,338 INFO L87 Difference]: Start difference. First operand 2709 states and 3438 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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:22:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:02,512 INFO L93 Difference]: Finished difference Result 7122 states and 9244 transitions. [2025-03-16 15:22:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 183 [2025-03-16 15:22:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:02,524 INFO L225 Difference]: With dead ends: 7122 [2025-03-16 15:22:02,524 INFO L226 Difference]: Without dead ends: 4414 [2025-03-16 15:22:02,528 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:22:02,529 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:02,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:22:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2025-03-16 15:22:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4414. [2025-03-16 15:22:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4414 states, 4413 states have (on average 1.2417856333559936) internal successors, (5480), 4413 states have internal predecessors, (5480), 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:22:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 5480 transitions. [2025-03-16 15:22:02,585 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 5480 transitions. Word has length 183 [2025-03-16 15:22:02,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:02,585 INFO L471 AbstractCegarLoop]: Abstraction has 4414 states and 5480 transitions. [2025-03-16 15:22:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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:22:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 5480 transitions. [2025-03-16 15:22:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-16 15:22:02,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:02,588 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:02,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:22:02,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1919492761, now seen corresponding path program 1 times [2025-03-16 15:22:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030673694] [2025-03-16 15:22:02,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:02,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-16 15:22:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-16 15:22:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:02,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-16 15:22:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030673694] [2025-03-16 15:22:02,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030673694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:02,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:02,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:02,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893514615] [2025-03-16 15:22:02,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:02,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:02,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:02,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:02,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:02,783 INFO L87 Difference]: Start difference. First operand 4414 states and 5480 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:22:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:04,083 INFO L93 Difference]: Finished difference Result 12653 states and 15710 transitions. [2025-03-16 15:22:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:04,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 260 [2025-03-16 15:22:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:04,099 INFO L225 Difference]: With dead ends: 12653 [2025-03-16 15:22:04,100 INFO L226 Difference]: Without dead ends: 7390 [2025-03-16 15:22:04,106 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:22:04,106 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 416 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:04,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 874 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:22:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7390 states. [2025-03-16 15:22:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7390 to 7390. [2025-03-16 15:22:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7390 states, 7389 states have (on average 1.1667343348220327) internal successors, (8621), 7389 states have internal predecessors, (8621), 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:22:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 8621 transitions. [2025-03-16 15:22:04,190 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 8621 transitions. Word has length 260 [2025-03-16 15:22:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:04,191 INFO L471 AbstractCegarLoop]: Abstraction has 7390 states and 8621 transitions. [2025-03-16 15:22:04,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:22:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 8621 transitions. [2025-03-16 15:22:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 15:22:04,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:04,194 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:04,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:22:04,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:04,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash -716853787, now seen corresponding path program 1 times [2025-03-16 15:22:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482158256] [2025-03-16 15:22:04,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:04,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 15:22:04,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 15:22:04,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:04,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 15:22:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482158256] [2025-03-16 15:22:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482158256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:04,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873540556] [2025-03-16 15:22:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:04,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:04,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:04,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:04,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:04,361 INFO L87 Difference]: Start difference. First operand 7390 states and 8621 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:22:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:05,687 INFO L93 Difference]: Finished difference Result 18608 states and 21940 transitions. [2025-03-16 15:22:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 277 [2025-03-16 15:22:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:05,712 INFO L225 Difference]: With dead ends: 18608 [2025-03-16 15:22:05,712 INFO L226 Difference]: Without dead ends: 10345 [2025-03-16 15:22:05,719 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:22:05,720 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 483 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:05,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 734 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:22:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10345 states. [2025-03-16 15:22:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10345 to 10343. [2025-03-16 15:22:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10343 states, 10342 states have (on average 1.1618642428930575) internal successors, (12016), 10342 states have internal predecessors, (12016), 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:22:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10343 states to 10343 states and 12016 transitions. [2025-03-16 15:22:05,842 INFO L78 Accepts]: Start accepts. Automaton has 10343 states and 12016 transitions. Word has length 277 [2025-03-16 15:22:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:05,842 INFO L471 AbstractCegarLoop]: Abstraction has 10343 states and 12016 transitions. [2025-03-16 15:22:05,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:22:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 10343 states and 12016 transitions. [2025-03-16 15:22:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-16 15:22:05,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:05,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:05,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:22:05,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:05,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 450545268, now seen corresponding path program 1 times [2025-03-16 15:22:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:05,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064912493] [2025-03-16 15:22:05,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:05,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-16 15:22:05,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-16 15:22:05,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:05,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:06,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:06,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064912493] [2025-03-16 15:22:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064912493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:06,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:06,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789169881] [2025-03-16 15:22:06,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:06,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:06,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:06,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:06,143 INFO L87 Difference]: Start difference. First operand 10343 states and 12016 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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:22:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:07,983 INFO L93 Difference]: Finished difference Result 24552 states and 28509 transitions. [2025-03-16 15:22:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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 370 [2025-03-16 15:22:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:08,011 INFO L225 Difference]: With dead ends: 24552 [2025-03-16 15:22:08,011 INFO L226 Difference]: Without dead ends: 13785 [2025-03-16 15:22:08,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:08,020 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 611 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:08,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 274 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:22:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13785 states. [2025-03-16 15:22:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13785 to 13780. [2025-03-16 15:22:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13780 states, 13779 states have (on average 1.1653240438348211) internal successors, (16057), 13779 states have internal predecessors, (16057), 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:22:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13780 states to 13780 states and 16057 transitions. [2025-03-16 15:22:08,145 INFO L78 Accepts]: Start accepts. Automaton has 13780 states and 16057 transitions. Word has length 370 [2025-03-16 15:22:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:08,146 INFO L471 AbstractCegarLoop]: Abstraction has 13780 states and 16057 transitions. [2025-03-16 15:22:08,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 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:22:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13780 states and 16057 transitions. [2025-03-16 15:22:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-16 15:22:08,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:08,155 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:08,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:22:08,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:08,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 158059502, now seen corresponding path program 1 times [2025-03-16 15:22:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201559131] [2025-03-16 15:22:08,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:08,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-16 15:22:08,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-16 15:22:08,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:08,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 59 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:08,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:08,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201559131] [2025-03-16 15:22:08,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201559131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:22:08,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431119674] [2025-03-16 15:22:08,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:08,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:22:08,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:22:08,605 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:22:08,606 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:22:08,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-16 15:22:08,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-16 15:22:08,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:08,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:08,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:22:08,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:22:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 59 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:09,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:22:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431119674] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:22:09,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:22:09,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:22:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343466956] [2025-03-16 15:22:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:09,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:09,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:09,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:09,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:22:09,524 INFO L87 Difference]: Start difference. First operand 13780 states and 16057 transitions. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 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:22:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:11,626 INFO L93 Difference]: Finished difference Result 33089 states and 38282 transitions. [2025-03-16 15:22:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 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 398 [2025-03-16 15:22:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:11,652 INFO L225 Difference]: With dead ends: 33089 [2025-03-16 15:22:11,652 INFO L226 Difference]: Without dead ends: 18033 [2025-03-16 15:22:11,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 793 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:22:11,660 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 759 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:11,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 134 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:22:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18033 states. [2025-03-16 15:22:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18033 to 14203. [2025-03-16 15:22:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14203 states, 14202 states have (on average 1.1605407689057878) internal successors, (16482), 14202 states have internal predecessors, (16482), 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:22:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14203 states to 14203 states and 16482 transitions. [2025-03-16 15:22:11,783 INFO L78 Accepts]: Start accepts. Automaton has 14203 states and 16482 transitions. Word has length 398 [2025-03-16 15:22:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:11,784 INFO L471 AbstractCegarLoop]: Abstraction has 14203 states and 16482 transitions. [2025-03-16 15:22:11,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 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:22:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14203 states and 16482 transitions. [2025-03-16 15:22:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-16 15:22:11,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:11,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:11,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:22:11,998 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:22:11,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1605452810, now seen corresponding path program 1 times [2025-03-16 15:22:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332880364] [2025-03-16 15:22:11,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:12,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-16 15:22:12,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-16 15:22:12,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:12,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 89 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332880364] [2025-03-16 15:22:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332880364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:22:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069628318] [2025-03-16 15:22:12,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:12,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:22:12,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:22:12,462 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:22:12,464 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:22:12,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-16 15:22:12,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-16 15:22:12,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:12,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:22:12,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:22:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 215 proven. 73 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 15:22:12,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:22:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 15:22:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069628318] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:22:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:22:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-03-16 15:22:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032434567] [2025-03-16 15:22:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:12,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:12,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:22:12,926 INFO L87 Difference]: Start difference. First operand 14203 states and 16482 transitions. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 3 states have internal predecessors, (443), 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:22:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:14,783 INFO L93 Difference]: Finished difference Result 35670 states and 41486 transitions. [2025-03-16 15:22:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 3 states have internal predecessors, (443), 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 472 [2025-03-16 15:22:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:14,816 INFO L225 Difference]: With dead ends: 35670 [2025-03-16 15:22:14,816 INFO L226 Difference]: Without dead ends: 21893 [2025-03-16 15:22:14,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 941 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:22:14,831 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 884 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:14,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 165 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:22:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21893 states. [2025-03-16 15:22:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21893 to 20186. [2025-03-16 15:22:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20186 states, 20185 states have (on average 1.1645281149368343) internal successors, (23506), 20185 states have internal predecessors, (23506), 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:22:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20186 states to 20186 states and 23506 transitions. [2025-03-16 15:22:15,082 INFO L78 Accepts]: Start accepts. Automaton has 20186 states and 23506 transitions. Word has length 472 [2025-03-16 15:22:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:15,083 INFO L471 AbstractCegarLoop]: Abstraction has 20186 states and 23506 transitions. [2025-03-16 15:22:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 3 states have internal predecessors, (443), 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:22:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 20186 states and 23506 transitions. [2025-03-16 15:22:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-16 15:22:15,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:15,099 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 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] [2025-03-16 15:22:15,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:22:15,299 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,SelfDestructingSolverStorable9 [2025-03-16 15:22:15,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:15,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1086134982, now seen corresponding path program 1 times [2025-03-16 15:22:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807910965] [2025-03-16 15:22:15,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:15,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-16 15:22:15,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-16 15:22:15,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:15,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-16 15:22:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807910965] [2025-03-16 15:22:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807910965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213788018] [2025-03-16 15:22:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:15,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:15,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:15,531 INFO L87 Difference]: Start difference. First operand 20186 states and 23506 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:22:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:16,740 INFO L93 Difference]: Finished difference Result 47603 states and 55423 transitions. [2025-03-16 15:22:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:16,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 528 [2025-03-16 15:22:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:16,786 INFO L225 Difference]: With dead ends: 47603 [2025-03-16 15:22:16,786 INFO L226 Difference]: Without dead ends: 25283 [2025-03-16 15:22:16,800 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:22:16,801 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 492 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:16,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 716 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:22:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25283 states. [2025-03-16 15:22:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25283 to 25277. [2025-03-16 15:22:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25277 states, 25276 states have (on average 1.1408055072005063) internal successors, (28835), 25276 states have internal predecessors, (28835), 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:22:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25277 states to 25277 states and 28835 transitions. [2025-03-16 15:22:17,227 INFO L78 Accepts]: Start accepts. Automaton has 25277 states and 28835 transitions. Word has length 528 [2025-03-16 15:22:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:17,227 INFO L471 AbstractCegarLoop]: Abstraction has 25277 states and 28835 transitions. [2025-03-16 15:22:17,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:22:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25277 states and 28835 transitions. [2025-03-16 15:22:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-16 15:22:17,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:17,238 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 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] [2025-03-16 15:22:17,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:22:17,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:17,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1856420299, now seen corresponding path program 1 times [2025-03-16 15:22:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:17,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096881582] [2025-03-16 15:22:17,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:17,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-16 15:22:17,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-16 15:22:17,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:17,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 15:22:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096881582] [2025-03-16 15:22:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096881582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029122220] [2025-03-16 15:22:17,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:17,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:17,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:17,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:17,520 INFO L87 Difference]: Start difference. First operand 25277 states and 28835 transitions. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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:22:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:18,681 INFO L93 Difference]: Finished difference Result 59508 states and 68274 transitions. [2025-03-16 15:22:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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 578 [2025-03-16 15:22:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:18,713 INFO L225 Difference]: With dead ends: 59508 [2025-03-16 15:22:18,713 INFO L226 Difference]: Without dead ends: 32100 [2025-03-16 15:22:18,733 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:22:18,733 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 426 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:18,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 639 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:22:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32100 states. [2025-03-16 15:22:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32100 to 32096. [2025-03-16 15:22:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32096 states, 32095 states have (on average 1.1451316404424365) internal successors, (36753), 32095 states have internal predecessors, (36753), 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:22:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32096 states to 32096 states and 36753 transitions. [2025-03-16 15:22:19,117 INFO L78 Accepts]: Start accepts. Automaton has 32096 states and 36753 transitions. Word has length 578 [2025-03-16 15:22:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:19,117 INFO L471 AbstractCegarLoop]: Abstraction has 32096 states and 36753 transitions. [2025-03-16 15:22:19,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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:22:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32096 states and 36753 transitions. [2025-03-16 15:22:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-16 15:22:19,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:19,135 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:19,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:22:19,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1344203855, now seen corresponding path program 1 times [2025-03-16 15:22:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:19,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674202103] [2025-03-16 15:22:19,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:19,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-16 15:22:19,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-16 15:22:19,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:19,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-03-16 15:22:19,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:19,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674202103] [2025-03-16 15:22:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674202103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520426112] [2025-03-16 15:22:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:19,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:19,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:19,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:19,352 INFO L87 Difference]: Start difference. First operand 32096 states and 36753 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:22:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:20,638 INFO L93 Difference]: Finished difference Result 77825 states and 89363 transitions. [2025-03-16 15:22:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:20,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 657 [2025-03-16 15:22:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:20,679 INFO L225 Difference]: With dead ends: 77825 [2025-03-16 15:22:20,679 INFO L226 Difference]: Without dead ends: 46155 [2025-03-16 15:22:20,694 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:22:20,695 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 486 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:20,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 291 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:22:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46155 states. [2025-03-16 15:22:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46155 to 46133. [2025-03-16 15:22:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46133 states, 46132 states have (on average 1.1360227174195785) internal successors, (52407), 46132 states have internal predecessors, (52407), 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:22:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46133 states to 46133 states and 52407 transitions. [2025-03-16 15:22:21,107 INFO L78 Accepts]: Start accepts. Automaton has 46133 states and 52407 transitions. Word has length 657 [2025-03-16 15:22:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:21,108 INFO L471 AbstractCegarLoop]: Abstraction has 46133 states and 52407 transitions. [2025-03-16 15:22:21,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:22:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 46133 states and 52407 transitions. [2025-03-16 15:22:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-03-16 15:22:21,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:21,132 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:22:21,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1044851504, now seen corresponding path program 1 times [2025-03-16 15:22:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517546189] [2025-03-16 15:22:21,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:21,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-03-16 15:22:21,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-03-16 15:22:21,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:21,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-16 15:22:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517546189] [2025-03-16 15:22:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517546189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501934898] [2025-03-16 15:22:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:21,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:21,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:21,594 INFO L87 Difference]: Start difference. First operand 46133 states and 52407 transitions. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:22:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:23,035 INFO L93 Difference]: Finished difference Result 110989 states and 125960 transitions. [2025-03-16 15:22:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:23,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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 714 [2025-03-16 15:22:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:23,106 INFO L225 Difference]: With dead ends: 110989 [2025-03-16 15:22:23,106 INFO L226 Difference]: Without dead ends: 65282 [2025-03-16 15:22:23,138 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:22:23,139 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 391 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:23,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 261 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:22:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65282 states. [2025-03-16 15:22:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65282 to 62721. [2025-03-16 15:22:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62721 states, 62720 states have (on average 1.1216198979591836) internal successors, (70348), 62720 states have internal predecessors, (70348), 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:22:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62721 states to 62721 states and 70348 transitions. [2025-03-16 15:22:23,959 INFO L78 Accepts]: Start accepts. Automaton has 62721 states and 70348 transitions. Word has length 714 [2025-03-16 15:22:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:23,963 INFO L471 AbstractCegarLoop]: Abstraction has 62721 states and 70348 transitions. [2025-03-16 15:22:23,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:22:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 62721 states and 70348 transitions. [2025-03-16 15:22:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-03-16 15:22:23,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:23,992 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:23,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:22:23,992 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:23,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash -331941827, now seen corresponding path program 1 times [2025-03-16 15:22:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146138663] [2025-03-16 15:22:23,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:24,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-03-16 15:22:24,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-03-16 15:22:24,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:24,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-16 15:22:24,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:24,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146138663] [2025-03-16 15:22:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146138663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:24,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:22:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789300917] [2025-03-16 15:22:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:24,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:24,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:24,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:24,523 INFO L87 Difference]: Start difference. First operand 62721 states and 70348 transitions. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 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:22:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:26,455 INFO L93 Difference]: Finished difference Result 155694 states and 174287 transitions. [2025-03-16 15:22:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 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 736 [2025-03-16 15:22:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:26,549 INFO L225 Difference]: With dead ends: 155694 [2025-03-16 15:22:26,550 INFO L226 Difference]: Without dead ends: 93399 [2025-03-16 15:22:26,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:26,592 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 773 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:26,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 181 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:22:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93399 states. [2025-03-16 15:22:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93399 to 91690. [2025-03-16 15:22:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91690 states, 91689 states have (on average 1.1132087818604195) internal successors, (102069), 91689 states have internal predecessors, (102069), 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:22:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91690 states to 91690 states and 102069 transitions. [2025-03-16 15:22:27,443 INFO L78 Accepts]: Start accepts. Automaton has 91690 states and 102069 transitions. Word has length 736 [2025-03-16 15:22:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:27,443 INFO L471 AbstractCegarLoop]: Abstraction has 91690 states and 102069 transitions. [2025-03-16 15:22:27,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 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:22:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 91690 states and 102069 transitions. [2025-03-16 15:22:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2025-03-16 15:22:27,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:27,483 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:22:27,483 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:27,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1371450083, now seen corresponding path program 1 times [2025-03-16 15:22:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642228596] [2025-03-16 15:22:27,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:27,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-03-16 15:22:27,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-03-16 15:22:27,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:27,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 847 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 15:22:28,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:28,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642228596] [2025-03-16 15:22:28,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642228596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:28,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:28,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:22:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887445741] [2025-03-16 15:22:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:28,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:28,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:28,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:28,471 INFO L87 Difference]: Start difference. First operand 91690 states and 102069 transitions. Second operand has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:22:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:30,521 INFO L93 Difference]: Finished difference Result 192730 states and 213925 transitions. [2025-03-16 15:22:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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 807 [2025-03-16 15:22:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:30,640 INFO L225 Difference]: With dead ends: 192730 [2025-03-16 15:22:30,641 INFO L226 Difference]: Without dead ends: 101464 [2025-03-16 15:22:30,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:30,698 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 622 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:30,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 365 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:22:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101464 states. [2025-03-16 15:22:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101464 to 94653. [2025-03-16 15:22:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94653 states, 94652 states have (on average 1.097620758145628) internal successors, (103892), 94652 states have internal predecessors, (103892), 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:22:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94653 states to 94653 states and 103892 transitions. [2025-03-16 15:22:31,931 INFO L78 Accepts]: Start accepts. Automaton has 94653 states and 103892 transitions. Word has length 807 [2025-03-16 15:22:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:31,932 INFO L471 AbstractCegarLoop]: Abstraction has 94653 states and 103892 transitions. [2025-03-16 15:22:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:22:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 94653 states and 103892 transitions. [2025-03-16 15:22:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2025-03-16 15:22:31,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:31,974 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:31,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:22:31,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:31,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash -653723629, now seen corresponding path program 1 times [2025-03-16 15:22:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:31,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906294298] [2025-03-16 15:22:31,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:32,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 808 statements into 1 equivalence classes. [2025-03-16 15:22:32,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 808 of 808 statements. [2025-03-16 15:22:32,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:32,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-16 15:22:32,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:32,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906294298] [2025-03-16 15:22:32,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906294298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:32,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:32,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980167658] [2025-03-16 15:22:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:32,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:32,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:32,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:32,397 INFO L87 Difference]: Start difference. First operand 94653 states and 103892 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:22:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:33,827 INFO L93 Difference]: Finished difference Result 194828 states and 213547 transitions. [2025-03-16 15:22:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:33,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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 808 [2025-03-16 15:22:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:33,941 INFO L225 Difference]: With dead ends: 194828 [2025-03-16 15:22:33,942 INFO L226 Difference]: Without dead ends: 100601 [2025-03-16 15:22:33,971 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:22:33,971 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 504 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:33,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 207 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:22:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100601 states. [2025-03-16 15:22:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100601 to 95491. [2025-03-16 15:22:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95491 states, 95490 states have (on average 1.0874856005864488) internal successors, (103844), 95490 states have internal predecessors, (103844), 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:22:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95491 states to 95491 states and 103844 transitions. [2025-03-16 15:22:35,024 INFO L78 Accepts]: Start accepts. Automaton has 95491 states and 103844 transitions. Word has length 808 [2025-03-16 15:22:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:35,024 INFO L471 AbstractCegarLoop]: Abstraction has 95491 states and 103844 transitions. [2025-03-16 15:22:35,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:22:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 95491 states and 103844 transitions. [2025-03-16 15:22:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-16 15:22:35,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:35,070 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:35,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:22:35,070 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:35,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1592760358, now seen corresponding path program 1 times [2025-03-16 15:22:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230294017] [2025-03-16 15:22:35,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:35,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 827 statements into 1 equivalence classes. [2025-03-16 15:22:35,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 827 of 827 statements. [2025-03-16 15:22:35,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:35,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-16 15:22:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230294017] [2025-03-16 15:22:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230294017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:35,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:35,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:22:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6339240] [2025-03-16 15:22:35,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:35,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:35,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:35,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:35,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:35,757 INFO L87 Difference]: Start difference. First operand 95491 states and 103844 transitions. Second operand has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 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:22:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:37,827 INFO L93 Difference]: Finished difference Result 222500 states and 241465 transitions. [2025-03-16 15:22:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:37,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 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 827 [2025-03-16 15:22:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:37,982 INFO L225 Difference]: With dead ends: 222500 [2025-03-16 15:22:37,982 INFO L226 Difference]: Without dead ends: 127010 [2025-03-16 15:22:38,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:38,046 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 468 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:38,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 200 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:22:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127010 states. [2025-03-16 15:22:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127010 to 119779. [2025-03-16 15:22:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119779 states, 119778 states have (on average 1.0811751740720332) internal successors, (129501), 119778 states have internal predecessors, (129501), 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:22:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119779 states to 119779 states and 129501 transitions. [2025-03-16 15:22:39,575 INFO L78 Accepts]: Start accepts. Automaton has 119779 states and 129501 transitions. Word has length 827 [2025-03-16 15:22:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:39,576 INFO L471 AbstractCegarLoop]: Abstraction has 119779 states and 129501 transitions. [2025-03-16 15:22:39,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 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:22:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 119779 states and 129501 transitions. [2025-03-16 15:22:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2025-03-16 15:22:39,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:39,637 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:39,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:22:39,637 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:39,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 193712036, now seen corresponding path program 1 times [2025-03-16 15:22:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977648544] [2025-03-16 15:22:39,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:39,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-16 15:22:39,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-16 15:22:39,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:39,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 919 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 15:22:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977648544] [2025-03-16 15:22:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977648544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:22:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68407140] [2025-03-16 15:22:40,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:40,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:40,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:40,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:40,508 INFO L87 Difference]: Start difference. First operand 119779 states and 129501 transitions. Second operand has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 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:22:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:42,535 INFO L93 Difference]: Finished difference Result 265957 states and 287223 transitions. [2025-03-16 15:22:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 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 832 [2025-03-16 15:22:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:42,702 INFO L225 Difference]: With dead ends: 265957 [2025-03-16 15:22:42,702 INFO L226 Difference]: Without dead ends: 146179 [2025-03-16 15:22:42,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:42,772 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 469 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:42,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 187 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:22:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146179 states. [2025-03-16 15:22:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146179 to 120629. [2025-03-16 15:22:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120629 states, 120628 states have (on average 1.0815233610770303) internal successors, (130462), 120628 states have internal predecessors, (130462), 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:22:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120629 states to 120629 states and 130462 transitions. [2025-03-16 15:22:44,269 INFO L78 Accepts]: Start accepts. Automaton has 120629 states and 130462 transitions. Word has length 832 [2025-03-16 15:22:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:44,270 INFO L471 AbstractCegarLoop]: Abstraction has 120629 states and 130462 transitions. [2025-03-16 15:22:44,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 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:22:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 120629 states and 130462 transitions. [2025-03-16 15:22:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-03-16 15:22:44,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:44,312 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, 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, 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, 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] [2025-03-16 15:22:44,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:22:44,312 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:44,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1487361606, now seen corresponding path program 1 times [2025-03-16 15:22:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:44,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040131853] [2025-03-16 15:22:44,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:44,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-03-16 15:22:44,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-03-16 15:22:44,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:44,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 1146 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-16 15:22:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:44,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040131853] [2025-03-16 15:22:44,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040131853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:44,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721481290] [2025-03-16 15:22:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:44,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:44,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:44,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:44,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:44,812 INFO L87 Difference]: Start difference. First operand 120629 states and 130462 transitions. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:22:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:46,370 INFO L93 Difference]: Finished difference Result 257497 states and 278200 transitions. [2025-03-16 15:22:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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 841 [2025-03-16 15:22:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:46,506 INFO L225 Difference]: With dead ends: 257497 [2025-03-16 15:22:46,506 INFO L226 Difference]: Without dead ends: 137294 [2025-03-16 15:22:46,545 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:22:46,546 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 327 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:46,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 764 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:22:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137294 states. [2025-03-16 15:22:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137294 to 133024. [2025-03-16 15:22:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133024 states, 133023 states have (on average 1.076964134021936) internal successors, (143261), 133023 states have internal predecessors, (143261), 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:22:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133024 states to 133024 states and 143261 transitions. [2025-03-16 15:22:47,967 INFO L78 Accepts]: Start accepts. Automaton has 133024 states and 143261 transitions. Word has length 841 [2025-03-16 15:22:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:47,967 INFO L471 AbstractCegarLoop]: Abstraction has 133024 states and 143261 transitions. [2025-03-16 15:22:47,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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:22:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 133024 states and 143261 transitions. [2025-03-16 15:22:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2025-03-16 15:22:48,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:48,013 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, 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, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 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:22:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:22:48,013 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:48,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 377080324, now seen corresponding path program 1 times [2025-03-16 15:22:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631266608] [2025-03-16 15:22:48,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:48,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes. [2025-03-16 15:22:48,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements. [2025-03-16 15:22:48,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:48,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 1086 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 15:22:48,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:48,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631266608] [2025-03-16 15:22:48,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631266608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:48,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:22:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176150853] [2025-03-16 15:22:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:22:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:48,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:22:48,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:48,663 INFO L87 Difference]: Start difference. First operand 133024 states and 143261 transitions. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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:22:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:51,559 INFO L93 Difference]: Finished difference Result 303955 states and 327050 transitions. [2025-03-16 15:22:51,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:22:51,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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 906 [2025-03-16 15:22:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:51,769 INFO L225 Difference]: With dead ends: 303955 [2025-03-16 15:22:51,769 INFO L226 Difference]: Without dead ends: 171357 [2025-03-16 15:22:51,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:51,849 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1068 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 3668 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 4148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 3668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:51,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 234 Invalid, 4148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 3668 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:22:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171357 states. [2025-03-16 15:22:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171357 to 157303. [2025-03-16 15:22:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157303 states, 157302 states have (on average 1.0711942632642941) internal successors, (168501), 157302 states have internal predecessors, (168501), 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:22:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157303 states to 157303 states and 168501 transitions. [2025-03-16 15:22:53,655 INFO L78 Accepts]: Start accepts. Automaton has 157303 states and 168501 transitions. Word has length 906 [2025-03-16 15:22:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:53,656 INFO L471 AbstractCegarLoop]: Abstraction has 157303 states and 168501 transitions. [2025-03-16 15:22:53,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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:22:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 157303 states and 168501 transitions. [2025-03-16 15:22:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2025-03-16 15:22:53,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:53,704 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, 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, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 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:22:53,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:22:53,704 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash -700020829, now seen corresponding path program 1 times [2025-03-16 15:22:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999151206] [2025-03-16 15:22:53,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:53,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:53,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes. [2025-03-16 15:22:53,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements. [2025-03-16 15:22:53,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:53,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 1086 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 15:22:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999151206] [2025-03-16 15:22:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999151206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:22:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076298941] [2025-03-16 15:22:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:54,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:22:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:54,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:22:54,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:54,362 INFO L87 Difference]: Start difference. First operand 157303 states and 168501 transitions. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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:22:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:57,448 INFO L93 Difference]: Finished difference Result 367012 states and 393517 transitions. [2025-03-16 15:22:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:22:57,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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 906 [2025-03-16 15:22:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:57,703 INFO L225 Difference]: With dead ends: 367012 [2025-03-16 15:22:57,703 INFO L226 Difference]: Without dead ends: 209710 [2025-03-16 15:22:57,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:57,819 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1019 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:57,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 217 Invalid, 3717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 3250 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:22:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209710 states. [2025-03-16 15:22:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209710 to 167528. [2025-03-16 15:22:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167528 states, 167527 states have (on average 1.0703528386469048) internal successors, (179313), 167527 states have internal predecessors, (179313), 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:23:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167528 states to 167528 states and 179313 transitions. [2025-03-16 15:23:00,144 INFO L78 Accepts]: Start accepts. Automaton has 167528 states and 179313 transitions. Word has length 906 [2025-03-16 15:23:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:00,145 INFO L471 AbstractCegarLoop]: Abstraction has 167528 states and 179313 transitions. [2025-03-16 15:23:00,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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:23:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 167528 states and 179313 transitions. [2025-03-16 15:23:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2025-03-16 15:23:00,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:00,195 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, 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, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:23:00,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:23:00,196 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1962200293, now seen corresponding path program 1 times [2025-03-16 15:23:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8329282] [2025-03-16 15:23:00,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 937 statements into 1 equivalence classes. [2025-03-16 15:23:00,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 937 of 937 statements. [2025-03-16 15:23:00,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:00,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 969 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-16 15:23:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:00,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8329282] [2025-03-16 15:23:00,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8329282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:00,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:00,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:00,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784471710] [2025-03-16 15:23:00,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:00,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:00,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:00,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:00,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:00,511 INFO L87 Difference]: Start difference. First operand 167528 states and 179313 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 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:23:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:01,661 INFO L93 Difference]: Finished difference Result 331207 states and 354345 transitions. [2025-03-16 15:23:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:01,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 2 states have internal predecessors, (529), 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 937 [2025-03-16 15:23:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:01,845 INFO L225 Difference]: With dead ends: 331207 [2025-03-16 15:23:01,845 INFO L226 Difference]: Without dead ends: 164105 [2025-03-16 15:23:01,937 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:23:01,938 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 487 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:01,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 84 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:23:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164105 states.