./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label51.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_label51.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 92aa4dc056ccedcde60ae7f447376d93fb9f66f20db418d40e67517b8efc809e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:20:41,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:20:41,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:20:41,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:20:41,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:20:41,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:20:41,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:20:41,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:20:41,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:20:41,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:20:41,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:20:41,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:20:41,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:20:41,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:20:41,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:20:41,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:20:41,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:20:41,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:20:41,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:20:41,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:20:41,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:20:41,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:20:41,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:20:41,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:20:41,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:20:41,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:20:41,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:20:41,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:20:41,661 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 -> 92aa4dc056ccedcde60ae7f447376d93fb9f66f20db418d40e67517b8efc809e [2025-03-16 15:20:41,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:20:41,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:20:41,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:20:41,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:20:41,905 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:20:41,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label51.c [2025-03-16 15:20:43,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f20b479a/edf488d6422d4e029c94814cdd0092d2/FLAG58bd93b25 [2025-03-16 15:20:43,395 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:20:43,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label51.c [2025-03-16 15:20:43,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f20b479a/edf488d6422d4e029c94814cdd0092d2/FLAG58bd93b25 [2025-03-16 15:20:43,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f20b479a/edf488d6422d4e029c94814cdd0092d2 [2025-03-16 15:20:43,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:20:43,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:20:43,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:20:43,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:20:43,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:20:43,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:20:43" (1/1) ... [2025-03-16 15:20:43,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdbbbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:43, skipping insertion in model container [2025-03-16 15:20:43,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:20:43" (1/1) ... [2025-03-16 15:20:43,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:20:43,642 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_label51.c[5625,5638] [2025-03-16 15:20:43,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:20:43,951 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:20:43,967 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_label51.c[5625,5638] [2025-03-16 15:20:44,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:20:44,162 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:20:44,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44 WrapperNode [2025-03-16 15:20:44,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:20:44,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:20:44,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:20:44,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:20:44,168 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:20:44" (1/1) ... [2025-03-16 15:20:44,199 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:20:44" (1/1) ... [2025-03-16 15:20:44,389 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:20:44,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:20:44,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:20:44,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:20:44,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:20:44,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,559 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:20:44,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:20:44,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:20:44,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:20:44,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:20:44,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (1/1) ... [2025-03-16 15:20:44,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:20:44,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:20:44,720 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:20:44,722 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:20:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:20:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:20:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:20:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:20:44,789 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:20:44,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:20:47,289 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:20:47,368 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:20:47,369 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:20:47,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:20:47,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:20:47,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:20:47 BoogieIcfgContainer [2025-03-16 15:20:47,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:20:47,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:20:47,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:20:47,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:20:47,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:20:43" (1/3) ... [2025-03-16 15:20:47,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b4eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:20:47, skipping insertion in model container [2025-03-16 15:20:47,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:20:44" (2/3) ... [2025-03-16 15:20:47,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b4eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:20:47, skipping insertion in model container [2025-03-16 15:20:47,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:20:47" (3/3) ... [2025-03-16 15:20:47,404 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label51.c [2025-03-16 15:20:47,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:20:47,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label51.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:20:47,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:20:47,480 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;@7ac8c9f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:20:47,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:20:47,485 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:20:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 15:20:47,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:47,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:47,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:47,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1695838590, now seen corresponding path program 1 times [2025-03-16 15:20:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:47,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172058917] [2025-03-16 15:20:47,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:47,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 15:20:47,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 15:20:47,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:47,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:47,612 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:20:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172058917] [2025-03-16 15:20:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172058917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:20:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614550063] [2025-03-16 15:20:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:47,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:20:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:47,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:20:47,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:20:47,636 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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:20:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:47,690 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:20:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:20:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2025-03-16 15:20:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:47,711 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:20:47,711 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:20:47,714 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:20:47,718 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:20:47,719 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:20:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:20:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:20:47,767 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:20:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:20:47,773 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 36 [2025-03-16 15:20:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:47,774 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:20:47,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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:20:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:20:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 15:20:47,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:47,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:47,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:20:47,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:47,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash -426895013, now seen corresponding path program 1 times [2025-03-16 15:20:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:47,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753415603] [2025-03-16 15:20:47,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:47,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:47,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 15:20:47,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 15:20:47,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:47,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:47,944 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:20:47,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753415603] [2025-03-16 15:20:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753415603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:47,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:20:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296564674] [2025-03-16 15:20:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:47,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:47,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:47,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:47,946 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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:20:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:49,827 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2025-03-16 15:20:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:49,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2025-03-16 15:20:49,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:49,832 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 15:20:49,832 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 15:20:49,833 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:20:49,833 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 435 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:49,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 449 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:20:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 15:20:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2025-03-16 15:20:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 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:20:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2025-03-16 15:20:49,876 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 36 [2025-03-16 15:20:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:49,876 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2025-03-16 15:20:49,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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:20:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2025-03-16 15:20:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 15:20:49,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:49,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:49,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:20:49,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:49,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1269588775, now seen corresponding path program 1 times [2025-03-16 15:20:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:49,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698369697] [2025-03-16 15:20:49,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:49,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:49,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 15:20:49,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 15:20:49,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:49,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:20:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698369697] [2025-03-16 15:20:50,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698369697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:50,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:50,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:20:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328706639] [2025-03-16 15:20:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:50,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:50,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:50,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:50,155 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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:20:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:51,853 INFO L93 Difference]: Finished difference Result 2814 states and 4381 transitions. [2025-03-16 15:20:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:51,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2025-03-16 15:20:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:51,858 INFO L225 Difference]: With dead ends: 2814 [2025-03-16 15:20:51,858 INFO L226 Difference]: Without dead ends: 1845 [2025-03-16 15:20:51,859 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:20:51,860 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:51,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:20:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-03-16 15:20:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1840. [2025-03-16 15:20:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3507340946166395) internal successors, (2484), 1839 states have internal predecessors, (2484), 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:20:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2484 transitions. [2025-03-16 15:20:51,894 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2484 transitions. Word has length 103 [2025-03-16 15:20:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:51,895 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2484 transitions. [2025-03-16 15:20:51,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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:20:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2484 transitions. [2025-03-16 15:20:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 15:20:51,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:51,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:20:51,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:51,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1711173427, now seen corresponding path program 1 times [2025-03-16 15:20:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314941864] [2025-03-16 15:20:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:51,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 15:20:51,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 15:20:51,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:20:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:52,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314941864] [2025-03-16 15:20:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314941864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:52,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:52,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885655615] [2025-03-16 15:20:52,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:52,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:52,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:52,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:52,133 INFO L87 Difference]: Start difference. First operand 1840 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:20:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:53,740 INFO L93 Difference]: Finished difference Result 4551 states and 6284 transitions. [2025-03-16 15:20:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 106 [2025-03-16 15:20:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:53,748 INFO L225 Difference]: With dead ends: 4551 [2025-03-16 15:20:53,748 INFO L226 Difference]: Without dead ends: 2712 [2025-03-16 15:20:53,751 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:20:53,754 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 470 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:53,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 884 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:20:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-03-16 15:20:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2710. [2025-03-16 15:20:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.3008490217792543) internal successors, (3524), 2709 states have internal predecessors, (3524), 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:20:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3524 transitions. [2025-03-16 15:20:53,797 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3524 transitions. Word has length 106 [2025-03-16 15:20:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3524 transitions. [2025-03-16 15:20:53,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:20:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3524 transitions. [2025-03-16 15:20:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 15:20:53,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:53,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:20:53,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:20:53,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:53,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2132383148, now seen corresponding path program 1 times [2025-03-16 15:20:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:53,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925530484] [2025-03-16 15:20:53,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:53,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:53,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 15:20:53,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 15:20:53,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:53,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 15:20:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925530484] [2025-03-16 15:20:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925530484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:53,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:53,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:20:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931380903] [2025-03-16 15:20:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:53,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:53,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:53,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:53,977 INFO L87 Difference]: Start difference. First operand 2710 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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:20:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:55,350 INFO L93 Difference]: Finished difference Result 7983 states and 10363 transitions. [2025-03-16 15:20:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:55,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 175 [2025-03-16 15:20:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:55,362 INFO L225 Difference]: With dead ends: 7983 [2025-03-16 15:20:55,362 INFO L226 Difference]: Without dead ends: 4420 [2025-03-16 15:20:55,366 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:20:55,366 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 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.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:55,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:20:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2025-03-16 15:20:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3565. [2025-03-16 15:20:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3564 states have (on average 1.1778900112233446) internal successors, (4198), 3564 states have internal predecessors, (4198), 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:20:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4198 transitions. [2025-03-16 15:20:55,419 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4198 transitions. Word has length 175 [2025-03-16 15:20:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:55,420 INFO L471 AbstractCegarLoop]: Abstraction has 3565 states and 4198 transitions. [2025-03-16 15:20:55,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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:20:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4198 transitions. [2025-03-16 15:20:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 15:20:55,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:55,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:55,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:20:55,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:55,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -887139946, now seen corresponding path program 1 times [2025-03-16 15:20:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:55,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470813112] [2025-03-16 15:20:55,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:55,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 15:20:55,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 15:20:55,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:55,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:20:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470813112] [2025-03-16 15:20:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470813112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143557386] [2025-03-16 15:20:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:55,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:55,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:55,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:55,612 INFO L87 Difference]: Start difference. First operand 3565 states and 4198 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:20:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:56,819 INFO L93 Difference]: Finished difference Result 9262 states and 11077 transitions. [2025-03-16 15:20:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:56,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 188 [2025-03-16 15:20:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:56,831 INFO L225 Difference]: With dead ends: 9262 [2025-03-16 15:20:56,831 INFO L226 Difference]: Without dead ends: 5698 [2025-03-16 15:20:56,835 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:20:56,836 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 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.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:56,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:20:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2025-03-16 15:20:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5698. [2025-03-16 15:20:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5697 states have (on average 1.1597331929085484) internal successors, (6607), 5697 states have internal predecessors, (6607), 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:20:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 6607 transitions. [2025-03-16 15:20:56,933 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 6607 transitions. Word has length 188 [2025-03-16 15:20:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:56,934 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 6607 transitions. [2025-03-16 15:20:56,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:20:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 6607 transitions. [2025-03-16 15:20:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 15:20:56,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:56,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:20:56,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:20:56,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:56,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 559247643, now seen corresponding path program 1 times [2025-03-16 15:20:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:56,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418763969] [2025-03-16 15:20:56,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:56,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 15:20:56,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 15:20:56,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:56,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:20:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418763969] [2025-03-16 15:20:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418763969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366402237] [2025-03-16 15:20:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:57,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:57,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:57,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:57,118 INFO L87 Difference]: Start difference. First operand 5698 states and 6607 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:20:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:20:58,611 INFO L93 Difference]: Finished difference Result 16124 states and 18723 transitions. [2025-03-16 15:20:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:20:58,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 190 [2025-03-16 15:20:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:20:58,632 INFO L225 Difference]: With dead ends: 16124 [2025-03-16 15:20:58,632 INFO L226 Difference]: Without dead ends: 10427 [2025-03-16 15:20:58,636 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:20:58,637 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 486 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:20:58,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 675 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:20:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10427 states. [2025-03-16 15:20:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10427 to 9124. [2025-03-16 15:20:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9124 states, 9123 states have (on average 1.1718732872958457) internal successors, (10691), 9123 states have internal predecessors, (10691), 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:20:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9124 states to 9124 states and 10691 transitions. [2025-03-16 15:20:58,734 INFO L78 Accepts]: Start accepts. Automaton has 9124 states and 10691 transitions. Word has length 190 [2025-03-16 15:20:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:20:58,734 INFO L471 AbstractCegarLoop]: Abstraction has 9124 states and 10691 transitions. [2025-03-16 15:20:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:20:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 9124 states and 10691 transitions. [2025-03-16 15:20:58,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-16 15:20:58,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:20:58,736 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:20:58,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:20:58,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:20:58,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:20:58,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2138291096, now seen corresponding path program 1 times [2025-03-16 15:20:58,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:20:58,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380923711] [2025-03-16 15:20:58,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:20:58,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:20:58,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-16 15:20:58,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-16 15:20:58,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:20:58,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:20:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 15:20:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:20:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380923711] [2025-03-16 15:20:58,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380923711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:20:58,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:20:58,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:20:58,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656967306] [2025-03-16 15:20:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:20:58,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:20:58,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:20:58,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:20:58,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:20:58,913 INFO L87 Difference]: Start difference. First operand 9124 states and 10691 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:00,199 INFO L93 Difference]: Finished difference Result 22910 states and 27054 transitions. [2025-03-16 15:21:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 268 [2025-03-16 15:21:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:00,253 INFO L225 Difference]: With dead ends: 22910 [2025-03-16 15:21:00,253 INFO L226 Difference]: Without dead ends: 12937 [2025-03-16 15:21:00,257 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:21:00,257 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 384 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:00,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 856 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:21:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12937 states. [2025-03-16 15:21:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12937 to 12937. [2025-03-16 15:21:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.1246907854050712) internal successors, (14549), 12936 states have internal predecessors, (14549), 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:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 14549 transitions. [2025-03-16 15:21:00,394 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 14549 transitions. Word has length 268 [2025-03-16 15:21:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:00,394 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 14549 transitions. [2025-03-16 15:21:00,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 14549 transitions. [2025-03-16 15:21:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-16 15:21:00,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:00,402 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:21:00,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:21:00,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:00,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1698811797, now seen corresponding path program 1 times [2025-03-16 15:21:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:00,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687472366] [2025-03-16 15:21:00,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:00,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:00,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 15:21:00,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 15:21:00,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:00,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:21:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687472366] [2025-03-16 15:21:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687472366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13881233] [2025-03-16 15:21:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:00,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:00,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:00,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:00,546 INFO L87 Difference]: Start difference. First operand 12937 states and 14549 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:02,023 INFO L93 Difference]: Finished difference Result 30978 states and 35160 transitions. [2025-03-16 15:21:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 308 [2025-03-16 15:21:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:02,052 INFO L225 Difference]: With dead ends: 30978 [2025-03-16 15:21:02,052 INFO L226 Difference]: Without dead ends: 18042 [2025-03-16 15:21:02,064 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:21:02,067 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 462 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:02,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 367 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:21:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18042 states. [2025-03-16 15:21:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18042 to 16759. [2025-03-16 15:21:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16759 states, 16758 states have (on average 1.1251342642320086) internal successors, (18855), 16758 states have internal predecessors, (18855), 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:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16759 states to 16759 states and 18855 transitions. [2025-03-16 15:21:02,258 INFO L78 Accepts]: Start accepts. Automaton has 16759 states and 18855 transitions. Word has length 308 [2025-03-16 15:21:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:02,259 INFO L471 AbstractCegarLoop]: Abstraction has 16759 states and 18855 transitions. [2025-03-16 15:21:02,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 16759 states and 18855 transitions. [2025-03-16 15:21:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-16 15:21:02,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:02,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:21:02,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash -443572668, now seen corresponding path program 1 times [2025-03-16 15:21:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687593016] [2025-03-16 15:21:02,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:02,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-16 15:21:02,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-16 15:21:02,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:02,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:21:02,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:02,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687593016] [2025-03-16 15:21:02,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687593016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:02,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:02,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:02,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034253778] [2025-03-16 15:21:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:02,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:02,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:02,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:02,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:02,580 INFO L87 Difference]: Start difference. First operand 16759 states and 18855 transitions. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 3 states have internal predecessors, (375), 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:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:04,466 INFO L93 Difference]: Finished difference Result 39087 states and 44155 transitions. [2025-03-16 15:21:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:04,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 3 states have internal predecessors, (375), 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 375 [2025-03-16 15:21:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:04,495 INFO L225 Difference]: With dead ends: 39087 [2025-03-16 15:21:04,495 INFO L226 Difference]: Without dead ends: 21904 [2025-03-16 15:21:04,509 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:21:04,509 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 637 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:04,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 226 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:21:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21904 states. [2025-03-16 15:21:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21904 to 21898. [2025-03-16 15:21:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21898 states, 21897 states have (on average 1.1352696716445174) internal successors, (24859), 21897 states have internal predecessors, (24859), 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:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21898 states to 21898 states and 24859 transitions. [2025-03-16 15:21:04,728 INFO L78 Accepts]: Start accepts. Automaton has 21898 states and 24859 transitions. Word has length 375 [2025-03-16 15:21:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 21898 states and 24859 transitions. [2025-03-16 15:21:04,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 3 states have internal predecessors, (375), 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:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21898 states and 24859 transitions. [2025-03-16 15:21:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-16 15:21:04,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:04,739 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:21:04,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:21:04,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:04,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:04,741 INFO L85 PathProgramCache]: Analyzing trace with hash -39479529, now seen corresponding path program 1 times [2025-03-16 15:21:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624255332] [2025-03-16 15:21:04,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:04,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-16 15:21:04,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-16 15:21:04,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:04,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:21:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624255332] [2025-03-16 15:21:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624255332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:05,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3187091] [2025-03-16 15:21:05,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:05,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:05,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:05,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:05,062 INFO L87 Difference]: Start difference. First operand 21898 states and 24859 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:06,475 INFO L93 Difference]: Finished difference Result 49771 states and 56804 transitions. [2025-03-16 15:21:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 422 [2025-03-16 15:21:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:06,507 INFO L225 Difference]: With dead ends: 49771 [2025-03-16 15:21:06,507 INFO L226 Difference]: Without dead ends: 27019 [2025-03-16 15:21:06,526 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:21:06,527 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 436 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:06,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 856 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:21:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27019 states. [2025-03-16 15:21:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27019 to 27013. [2025-03-16 15:21:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27013 states, 27012 states have (on average 1.1278690952169406) internal successors, (30466), 27012 states have internal predecessors, (30466), 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:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27013 states to 27013 states and 30466 transitions. [2025-03-16 15:21:06,754 INFO L78 Accepts]: Start accepts. Automaton has 27013 states and 30466 transitions. Word has length 422 [2025-03-16 15:21:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:06,755 INFO L471 AbstractCegarLoop]: Abstraction has 27013 states and 30466 transitions. [2025-03-16 15:21:06,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27013 states and 30466 transitions. [2025-03-16 15:21:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-16 15:21:06,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:06,805 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:21:06,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:06,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash 155223263, now seen corresponding path program 1 times [2025-03-16 15:21:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786697696] [2025-03-16 15:21:06,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:06,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-16 15:21:06,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-16 15:21:06,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:06,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-16 15:21:06,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786697696] [2025-03-16 15:21:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786697696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505934443] [2025-03-16 15:21:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:06,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:06,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:06,971 INFO L87 Difference]: Start difference. First operand 27013 states and 30466 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:08,374 INFO L93 Difference]: Finished difference Result 66810 states and 75543 transitions. [2025-03-16 15:21:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 478 [2025-03-16 15:21:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:08,415 INFO L225 Difference]: With dead ends: 66810 [2025-03-16 15:21:08,415 INFO L226 Difference]: Without dead ends: 39798 [2025-03-16 15:21:08,435 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:21:08,435 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 503 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:08,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 278 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:21:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39798 states. [2025-03-16 15:21:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39798 to 39351. [2025-03-16 15:21:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39351 states, 39350 states have (on average 1.121423125794155) internal successors, (44128), 39350 states have internal predecessors, (44128), 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:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39351 states to 39351 states and 44128 transitions. [2025-03-16 15:21:08,901 INFO L78 Accepts]: Start accepts. Automaton has 39351 states and 44128 transitions. Word has length 478 [2025-03-16 15:21:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:08,902 INFO L471 AbstractCegarLoop]: Abstraction has 39351 states and 44128 transitions. [2025-03-16 15:21:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 39351 states and 44128 transitions. [2025-03-16 15:21:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-16 15:21:08,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:08,913 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:21:08,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:08,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2101293122, now seen corresponding path program 1 times [2025-03-16 15:21:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:08,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792780963] [2025-03-16 15:21:08,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:08,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-16 15:21:08,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-16 15:21:08,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:08,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:21:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792780963] [2025-03-16 15:21:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792780963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345846543] [2025-03-16 15:21:09,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:09,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:21:09,472 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:21:09,473 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:21:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-16 15:21:09,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-16 15:21:09,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:09,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:09,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:21:09,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:21:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:21:09,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:21:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345846543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:21:09,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:21:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449449424] [2025-03-16 15:21:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:09,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:09,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:21:09,839 INFO L87 Difference]: Start difference. First operand 39351 states and 44128 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:11,212 INFO L93 Difference]: Finished difference Result 84652 states and 94907 transitions. [2025-03-16 15:21:11,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:11,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 479 [2025-03-16 15:21:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:11,257 INFO L225 Difference]: With dead ends: 84652 [2025-03-16 15:21:11,258 INFO L226 Difference]: Without dead ends: 43577 [2025-03-16 15:21:11,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:21:11,286 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 496 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:11,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 662 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:21:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43577 states. [2025-03-16 15:21:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43577 to 43574. [2025-03-16 15:21:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43574 states, 43573 states have (on average 1.1095173616689233) internal successors, (48345), 43573 states have internal predecessors, (48345), 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:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43574 states to 43574 states and 48345 transitions. [2025-03-16 15:21:11,662 INFO L78 Accepts]: Start accepts. Automaton has 43574 states and 48345 transitions. Word has length 479 [2025-03-16 15:21:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 43574 states and 48345 transitions. [2025-03-16 15:21:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 43574 states and 48345 transitions. [2025-03-16 15:21:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-16 15:21:11,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:11,674 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,681 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:21:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:21:11,878 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash -384609934, now seen corresponding path program 1 times [2025-03-16 15:21:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118465227] [2025-03-16 15:21:11,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:11,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-16 15:21:11,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-16 15:21:11,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:11,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 15:21:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118465227] [2025-03-16 15:21:12,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118465227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:12,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:12,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226835815] [2025-03-16 15:21:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:12,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:12,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:12,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:12,159 INFO L87 Difference]: Start difference. First operand 43574 states and 48345 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:13,455 INFO L93 Difference]: Finished difference Result 86713 states and 96197 transitions. [2025-03-16 15:21:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 503 [2025-03-16 15:21:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:13,501 INFO L225 Difference]: With dead ends: 86713 [2025-03-16 15:21:13,501 INFO L226 Difference]: Without dead ends: 43140 [2025-03-16 15:21:13,523 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:21:13,524 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 466 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:13,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 711 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:21:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43140 states. [2025-03-16 15:21:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43140 to 42713. [2025-03-16 15:21:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42713 states, 42712 states have (on average 1.0858306799026034) internal successors, (46378), 42712 states have internal predecessors, (46378), 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:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42713 states to 42713 states and 46378 transitions. [2025-03-16 15:21:13,889 INFO L78 Accepts]: Start accepts. Automaton has 42713 states and 46378 transitions. Word has length 503 [2025-03-16 15:21:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:13,889 INFO L471 AbstractCegarLoop]: Abstraction has 42713 states and 46378 transitions. [2025-03-16 15:21:13,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 42713 states and 46378 transitions. [2025-03-16 15:21:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-16 15:21:13,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:13,906 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:21:13,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -760267105, now seen corresponding path program 1 times [2025-03-16 15:21:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74980386] [2025-03-16 15:21:13,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:13,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-16 15:21:13,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-16 15:21:13,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:13,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:21:14,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:14,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74980386] [2025-03-16 15:21:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74980386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:14,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467290869] [2025-03-16 15:21:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:14,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:14,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:14,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:14,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:14,633 INFO L87 Difference]: Start difference. First operand 42713 states and 46378 transitions. Second operand has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 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:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:16,603 INFO L93 Difference]: Finished difference Result 98210 states and 106709 transitions. [2025-03-16 15:21:16,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:16,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 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 589 [2025-03-16 15:21:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:16,675 INFO L225 Difference]: With dead ends: 98210 [2025-03-16 15:21:16,675 INFO L226 Difference]: Without dead ends: 62758 [2025-03-16 15:21:16,707 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:21:16,708 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 542 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:16,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 163 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:21:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62758 states. [2025-03-16 15:21:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62758 to 57220. [2025-03-16 15:21:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57220 states, 57219 states have (on average 1.089603103864101) internal successors, (62346), 57219 states have internal predecessors, (62346), 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:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57220 states to 57220 states and 62346 transitions. [2025-03-16 15:21:17,397 INFO L78 Accepts]: Start accepts. Automaton has 57220 states and 62346 transitions. Word has length 589 [2025-03-16 15:21:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:17,398 INFO L471 AbstractCegarLoop]: Abstraction has 57220 states and 62346 transitions. [2025-03-16 15:21:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 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:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 57220 states and 62346 transitions. [2025-03-16 15:21:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-16 15:21:17,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:17,413 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:21:17,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:21:17,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:17,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash 361814612, now seen corresponding path program 1 times [2025-03-16 15:21:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:17,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658570218] [2025-03-16 15:21:17,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:17,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:17,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-16 15:21:17,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-16 15:21:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-16 15:21:18,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:18,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658570218] [2025-03-16 15:21:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658570218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:18,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:18,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931652539] [2025-03-16 15:21:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:18,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:21:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:18,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:21:18,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:21:18,016 INFO L87 Difference]: Start difference. First operand 57220 states and 62346 transitions. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 4 states have internal predecessors, (347), 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:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:19,652 INFO L93 Difference]: Finished difference Result 117039 states and 127405 transitions. [2025-03-16 15:21:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:21:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 4 states have internal predecessors, (347), 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 595 [2025-03-16 15:21:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:19,712 INFO L225 Difference]: With dead ends: 117039 [2025-03-16 15:21:19,713 INFO L226 Difference]: Without dead ends: 58906 [2025-03-16 15:21:19,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:21:19,745 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 862 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:19,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 155 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:21:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58906 states. [2025-03-16 15:21:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58906 to 56773. [2025-03-16 15:21:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56773 states, 56772 states have (on average 1.084707250052843) internal successors, (61581), 56772 states have internal predecessors, (61581), 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:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56773 states to 56773 states and 61581 transitions. [2025-03-16 15:21:20,256 INFO L78 Accepts]: Start accepts. Automaton has 56773 states and 61581 transitions. Word has length 595 [2025-03-16 15:21:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:20,256 INFO L471 AbstractCegarLoop]: Abstraction has 56773 states and 61581 transitions. [2025-03-16 15:21:20,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 4 states have internal predecessors, (347), 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:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 56773 states and 61581 transitions. [2025-03-16 15:21:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-16 15:21:20,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:20,402 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:21:20,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:21:20,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -328187866, now seen corresponding path program 1 times [2025-03-16 15:21:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919087816] [2025-03-16 15:21:20,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:20,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-16 15:21:20,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-16 15:21:20,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:20,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-16 15:21:20,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919087816] [2025-03-16 15:21:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919087816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:20,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087987569] [2025-03-16 15:21:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:20,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:20,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:20,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:20,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:20,992 INFO L87 Difference]: Start difference. First operand 56773 states and 61581 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:22,451 INFO L93 Difference]: Finished difference Result 126328 states and 137308 transitions. [2025-03-16 15:21:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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 603 [2025-03-16 15:21:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:22,534 INFO L225 Difference]: With dead ends: 126328 [2025-03-16 15:21:22,534 INFO L226 Difference]: Without dead ends: 68267 [2025-03-16 15:21:22,572 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:21:22,572 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 192 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:22,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 613 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:21:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68267 states. [2025-03-16 15:21:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68267 to 64010. [2025-03-16 15:21:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64010 states, 64009 states have (on average 1.084894311737412) internal successors, (69443), 64009 states have internal predecessors, (69443), 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:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64010 states to 64010 states and 69443 transitions. [2025-03-16 15:21:23,243 INFO L78 Accepts]: Start accepts. Automaton has 64010 states and 69443 transitions. Word has length 603 [2025-03-16 15:21:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:23,243 INFO L471 AbstractCegarLoop]: Abstraction has 64010 states and 69443 transitions. [2025-03-16 15:21:23,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 64010 states and 69443 transitions. [2025-03-16 15:21:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-03-16 15:21:23,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:23,261 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:21:23,261 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:23,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash 206771657, now seen corresponding path program 1 times [2025-03-16 15:21:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526102358] [2025-03-16 15:21:23,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-03-16 15:21:23,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-03-16 15:21:23,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:23,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:21:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526102358] [2025-03-16 15:21:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526102358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:23,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:23,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916875255] [2025-03-16 15:21:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:23,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:23,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:23,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:23,833 INFO L87 Difference]: Start difference. First operand 64010 states and 69443 transitions. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 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:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:25,164 INFO L93 Difference]: Finished difference Result 118203 states and 128012 transitions. [2025-03-16 15:21:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:25,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 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 632 [2025-03-16 15:21:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:25,236 INFO L225 Difference]: With dead ends: 118203 [2025-03-16 15:21:25,236 INFO L226 Difference]: Without dead ends: 65295 [2025-03-16 15:21:25,276 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:21:25,276 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 99 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:25,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 731 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:21:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65295 states. [2025-03-16 15:21:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65295 to 64012. [2025-03-16 15:21:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64012 states, 64011 states have (on average 1.0848916592460671) internal successors, (69445), 64011 states have internal predecessors, (69445), 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:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64012 states to 64012 states and 69445 transitions. [2025-03-16 15:21:25,815 INFO L78 Accepts]: Start accepts. Automaton has 64012 states and 69445 transitions. Word has length 632 [2025-03-16 15:21:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:25,815 INFO L471 AbstractCegarLoop]: Abstraction has 64012 states and 69445 transitions. [2025-03-16 15:21:25,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 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:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 64012 states and 69445 transitions. [2025-03-16 15:21:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-03-16 15:21:25,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:25,833 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:21:25,833 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:25,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash 521403244, now seen corresponding path program 1 times [2025-03-16 15:21:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011569328] [2025-03-16 15:21:25,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:25,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-03-16 15:21:25,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-03-16 15:21:25,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:25,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:21:26,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:26,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011569328] [2025-03-16 15:21:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011569328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:26,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:26,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962318540] [2025-03-16 15:21:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:26,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:26,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:26,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:26,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:26,233 INFO L87 Difference]: Start difference. First operand 64012 states and 69445 transitions. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:28,258 INFO L93 Difference]: Finished difference Result 133559 states and 144855 transitions. [2025-03-16 15:21:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 633 [2025-03-16 15:21:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:28,329 INFO L225 Difference]: With dead ends: 133559 [2025-03-16 15:21:28,329 INFO L226 Difference]: Without dead ends: 69548 [2025-03-16 15:21:28,363 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:21:28,364 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 769 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:28,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 160 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:21:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69548 states. [2025-03-16 15:21:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69548 to 61037. [2025-03-16 15:21:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61037 states, 61036 states have (on average 1.0820007864211285) internal successors, (66041), 61036 states have internal predecessors, (66041), 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:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61037 states to 61037 states and 66041 transitions. [2025-03-16 15:21:28,872 INFO L78 Accepts]: Start accepts. Automaton has 61037 states and 66041 transitions. Word has length 633 [2025-03-16 15:21:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:28,872 INFO L471 AbstractCegarLoop]: Abstraction has 61037 states and 66041 transitions. [2025-03-16 15:21:28,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61037 states and 66041 transitions. [2025-03-16 15:21:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-16 15:21:28,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:28,894 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:21:28,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:21:28,895 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:28,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash -938367283, now seen corresponding path program 1 times [2025-03-16 15:21:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920184143] [2025-03-16 15:21:28,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:29,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-16 15:21:29,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-16 15:21:29,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:29,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 461 proven. 160 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:21:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920184143] [2025-03-16 15:21:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920184143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386324379] [2025-03-16 15:21:29,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:21:29,897 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:21:29,898 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:21:29,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-16 15:21:30,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-16 15:21:30,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:30,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:30,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:21:30,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:21:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 391 proven. 78 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-03-16 15:21:30,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:21:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-03-16 15:21:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386324379] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:30,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:21:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2025-03-16 15:21:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455796818] [2025-03-16 15:21:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:30,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:30,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:30,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:21:30,578 INFO L87 Difference]: Start difference. First operand 61037 states and 66041 transitions. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 3 states have internal predecessors, (532), 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:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:32,793 INFO L93 Difference]: Finished difference Result 137407 states and 148617 transitions. [2025-03-16 15:21:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 3 states have internal predecessors, (532), 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 725 [2025-03-16 15:21:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:32,881 INFO L225 Difference]: With dead ends: 137407 [2025-03-16 15:21:32,881 INFO L226 Difference]: Without dead ends: 76371 [2025-03-16 15:21:32,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1452 GetRequests, 1446 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:21:32,925 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 841 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:32,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 147 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:21:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76371 states. [2025-03-16 15:21:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76371 to 69563. [2025-03-16 15:21:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69563 states, 69562 states have (on average 1.0791092838043759) internal successors, (75065), 69562 states have internal predecessors, (75065), 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:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69563 states to 69563 states and 75065 transitions. [2025-03-16 15:21:33,660 INFO L78 Accepts]: Start accepts. Automaton has 69563 states and 75065 transitions. Word has length 725 [2025-03-16 15:21:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:33,660 INFO L471 AbstractCegarLoop]: Abstraction has 69563 states and 75065 transitions. [2025-03-16 15:21:33,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 3 states have internal predecessors, (532), 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:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 69563 states and 75065 transitions. [2025-03-16 15:21:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2025-03-16 15:21:33,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:33,682 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:21:33,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:21:33,883 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,SelfDestructingSolverStorable19 [2025-03-16 15:21:33,883 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:33,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1142289024, now seen corresponding path program 1 times [2025-03-16 15:21:33,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303040395] [2025-03-16 15:21:33,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:33,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 750 statements into 1 equivalence classes. [2025-03-16 15:21:33,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 750 of 750 statements. [2025-03-16 15:21:33,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-16 15:21:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303040395] [2025-03-16 15:21:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303040395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:34,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:34,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557510740] [2025-03-16 15:21:34,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:34,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:34,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:34,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:34,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:34,070 INFO L87 Difference]: Start difference. First operand 69563 states and 75065 transitions. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:35,246 INFO L93 Difference]: Finished difference Result 136987 states and 147807 transitions. [2025-03-16 15:21:35,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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 750 [2025-03-16 15:21:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:35,318 INFO L225 Difference]: With dead ends: 136987 [2025-03-16 15:21:35,318 INFO L226 Difference]: Without dead ends: 67850 [2025-03-16 15:21:35,360 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:21:35,361 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 489 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:35,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 656 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:21:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67850 states. [2025-03-16 15:21:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67850 to 67421. [2025-03-16 15:21:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67421 states, 67420 states have (on average 1.0723969148620587) internal successors, (72301), 67420 states have internal predecessors, (72301), 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:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67421 states to 67421 states and 72301 transitions. [2025-03-16 15:21:35,961 INFO L78 Accepts]: Start accepts. Automaton has 67421 states and 72301 transitions. Word has length 750 [2025-03-16 15:21:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:35,962 INFO L471 AbstractCegarLoop]: Abstraction has 67421 states and 72301 transitions. [2025-03-16 15:21:35,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 67421 states and 72301 transitions. [2025-03-16 15:21:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-03-16 15:21:35,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:35,982 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:21:35,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:21:35,982 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:35,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 718240367, now seen corresponding path program 1 times [2025-03-16 15:21:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:35,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600915976] [2025-03-16 15:21:35,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-03-16 15:21:36,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-03-16 15:21:36,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:36,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:21:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600915976] [2025-03-16 15:21:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600915976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447461073] [2025-03-16 15:21:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:36,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:36,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:36,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:36,399 INFO L87 Difference]: Start difference. First operand 67421 states and 72301 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:38,242 INFO L93 Difference]: Finished difference Result 155717 states and 167069 transitions. [2025-03-16 15:21:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:38,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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 775 [2025-03-16 15:21:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:38,338 INFO L225 Difference]: With dead ends: 155717 [2025-03-16 15:21:38,339 INFO L226 Difference]: Without dead ends: 88722 [2025-03-16 15:21:38,380 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:21:38,381 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 577 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:38,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 255 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:21:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88722 states. [2025-03-16 15:21:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88722 to 75490. [2025-03-16 15:21:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75490 states, 75489 states have (on average 1.064684920981865) internal successors, (80372), 75489 states have internal predecessors, (80372), 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:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75490 states to 75490 states and 80372 transitions. [2025-03-16 15:21:39,092 INFO L78 Accepts]: Start accepts. Automaton has 75490 states and 80372 transitions. Word has length 775 [2025-03-16 15:21:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 75490 states and 80372 transitions. [2025-03-16 15:21:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 75490 states and 80372 transitions. [2025-03-16 15:21:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2025-03-16 15:21:39,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:39,113 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:21:39,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:21:39,114 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 929778483, now seen corresponding path program 1 times [2025-03-16 15:21:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372158418] [2025-03-16 15:21:39,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:39,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-03-16 15:21:39,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-03-16 15:21:39,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:39,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-16 15:21:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:39,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372158418] [2025-03-16 15:21:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372158418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:39,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:39,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062895833] [2025-03-16 15:21:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:39,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:39,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:39,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:39,537 INFO L87 Difference]: Start difference. First operand 75490 states and 80372 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:41,368 INFO L93 Difference]: Finished difference Result 162922 states and 173170 transitions. [2025-03-16 15:21:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:41,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 781 [2025-03-16 15:21:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:41,460 INFO L225 Difference]: With dead ends: 162922 [2025-03-16 15:21:41,460 INFO L226 Difference]: Without dead ends: 87858 [2025-03-16 15:21:41,511 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:21:41,511 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 585 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 284 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:21:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87858 states. [2025-03-16 15:21:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87858 to 75917. [2025-03-16 15:21:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75917 states, 75916 states have (on average 1.0644791611781443) internal successors, (80811), 75916 states have internal predecessors, (80811), 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:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75917 states to 75917 states and 80811 transitions. [2025-03-16 15:21:42,202 INFO L78 Accepts]: Start accepts. Automaton has 75917 states and 80811 transitions. Word has length 781 [2025-03-16 15:21:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:42,202 INFO L471 AbstractCegarLoop]: Abstraction has 75917 states and 80811 transitions. [2025-03-16 15:21:42,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 75917 states and 80811 transitions. [2025-03-16 15:21:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-03-16 15:21:42,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:42,225 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:21:42,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:21:42,226 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:42,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1138468471, now seen corresponding path program 1 times [2025-03-16 15:21:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:42,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113480491] [2025-03-16 15:21:42,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:42,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-03-16 15:21:42,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-03-16 15:21:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 15:21:42,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113480491] [2025-03-16 15:21:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113480491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:42,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:21:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271463233] [2025-03-16 15:21:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:42,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:42,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:42,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:21:42,827 INFO L87 Difference]: Start difference. First operand 75917 states and 80811 transitions. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 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:21:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:44,331 INFO L93 Difference]: Finished difference Result 159932 states and 170190 transitions. [2025-03-16 15:21:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:44,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 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 787 [2025-03-16 15:21:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:44,418 INFO L225 Difference]: With dead ends: 159932 [2025-03-16 15:21:44,418 INFO L226 Difference]: Without dead ends: 82733 [2025-03-16 15:21:44,467 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:21:44,468 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 306 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:44,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 603 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:21:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82733 states. [2025-03-16 15:21:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82733 to 78043. [2025-03-16 15:21:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78043 states, 78042 states have (on average 1.060288050024346) internal successors, (82747), 78042 states have internal predecessors, (82747), 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:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78043 states to 78043 states and 82747 transitions. [2025-03-16 15:21:45,130 INFO L78 Accepts]: Start accepts. Automaton has 78043 states and 82747 transitions. Word has length 787 [2025-03-16 15:21:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:45,131 INFO L471 AbstractCegarLoop]: Abstraction has 78043 states and 82747 transitions. [2025-03-16 15:21:45,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 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:21:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 78043 states and 82747 transitions. [2025-03-16 15:21:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2025-03-16 15:21:45,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:45,153 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:21:45,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:21:45,153 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1868858410, now seen corresponding path program 1 times [2025-03-16 15:21:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753524791] [2025-03-16 15:21:45,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:45,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-03-16 15:21:45,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-03-16 15:21:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 15:21:46,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:46,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753524791] [2025-03-16 15:21:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753524791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:46,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:21:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215865663] [2025-03-16 15:21:46,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:46,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 15:21:46,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:46,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 15:21:46,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:21:46,401 INFO L87 Difference]: Start difference. First operand 78043 states and 82747 transitions. Second operand has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 6 states have internal predecessors, (773), 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:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:48,567 INFO L93 Difference]: Finished difference Result 156085 states and 165501 transitions. [2025-03-16 15:21:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:21:48,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 6 states have internal predecessors, (773), 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:21:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:48,644 INFO L225 Difference]: With dead ends: 156085 [2025-03-16 15:21:48,645 INFO L226 Difference]: Without dead ends: 78468 [2025-03-16 15:21:48,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:21:48,697 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1765 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4403 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 4483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:48,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 292 Invalid, 4483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4403 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:21:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78468 states. [2025-03-16 15:21:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78468 to 78468. [2025-03-16 15:21:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78468 states, 78467 states have (on average 1.0599870009048389) internal successors, (83174), 78467 states have internal predecessors, (83174), 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:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78468 states to 78468 states and 83174 transitions. [2025-03-16 15:21:49,558 INFO L78 Accepts]: Start accepts. Automaton has 78468 states and 83174 transitions. Word has length 807 [2025-03-16 15:21:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:49,558 INFO L471 AbstractCegarLoop]: Abstraction has 78468 states and 83174 transitions. [2025-03-16 15:21:49,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 6 states have internal predecessors, (773), 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:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 78468 states and 83174 transitions. [2025-03-16 15:21:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2025-03-16 15:21:49,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:49,584 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:21:49,585 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:49,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash -431376107, now seen corresponding path program 1 times [2025-03-16 15:21:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143123232] [2025-03-16 15:21:49,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:49,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 880 statements into 1 equivalence classes. [2025-03-16 15:21:49,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 880 of 880 statements. [2025-03-16 15:21:49,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:49,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 1060 proven. 105 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:21:50,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143123232] [2025-03-16 15:21:50,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143123232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:21:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682990279] [2025-03-16 15:21:50,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:21:50,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:21:50,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:21:50,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 880 statements into 1 equivalence classes. [2025-03-16 15:21:50,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 880 of 880 statements. [2025-03-16 15:21:50,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:50,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:50,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:21:50,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:21:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2025-03-16 15:21:50,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:21:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682990279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:21:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:21:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654447198] [2025-03-16 15:21:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:21:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:21:50,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:21:50,918 INFO L87 Difference]: Start difference. First operand 78468 states and 83174 transitions. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:52,670 INFO L93 Difference]: Finished difference Result 165026 states and 174721 transitions. [2025-03-16 15:21:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:21:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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 880 [2025-03-16 15:21:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:52,772 INFO L225 Difference]: With dead ends: 165026 [2025-03-16 15:21:52,772 INFO L226 Difference]: Without dead ends: 86555 [2025-03-16 15:21:52,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 880 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:21:52,821 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 467 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:52,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 121 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:21:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86555 states. [2025-03-16 15:21:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86555 to 69911. [2025-03-16 15:21:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69911 states, 69910 states have (on average 1.058131883850665) internal successors, (73974), 69910 states have internal predecessors, (73974), 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:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69911 states to 69911 states and 73974 transitions. [2025-03-16 15:21:53,839 INFO L78 Accepts]: Start accepts. Automaton has 69911 states and 73974 transitions. Word has length 880 [2025-03-16 15:21:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:53,839 INFO L471 AbstractCegarLoop]: Abstraction has 69911 states and 73974 transitions. [2025-03-16 15:21:53,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 69911 states and 73974 transitions. [2025-03-16 15:21:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2025-03-16 15:21:53,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:53,883 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:21:53,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:21:54,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:21:54,084 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:54,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash -578667088, now seen corresponding path program 1 times [2025-03-16 15:21:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:54,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478705248] [2025-03-16 15:21:54,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:54,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 955 statements into 1 equivalence classes. [2025-03-16 15:21:54,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 955 of 955 statements. [2025-03-16 15:21:54,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 1052 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-16 15:21:54,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:54,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478705248] [2025-03-16 15:21:54,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478705248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:54,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733974916] [2025-03-16 15:21:54,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:54,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:54,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:54,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:54,666 INFO L87 Difference]: Start difference. First operand 69911 states and 73974 transitions. Second operand has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 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:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:21:56,622 INFO L93 Difference]: Finished difference Result 159408 states and 168559 transitions. [2025-03-16 15:21:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:21:56,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 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 955 [2025-03-16 15:21:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:21:56,715 INFO L225 Difference]: With dead ends: 159408 [2025-03-16 15:21:56,715 INFO L226 Difference]: Without dead ends: 89498 [2025-03-16 15:21:56,757 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:21:56,757 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 326 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:21:56,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 185 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:21:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89498 states. [2025-03-16 15:21:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89498 to 76314. [2025-03-16 15:21:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76314 states, 76313 states have (on average 1.0573558895601012) internal successors, (80690), 76313 states have internal predecessors, (80690), 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,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76314 states to 76314 states and 80690 transitions. [2025-03-16 15:21:57,529 INFO L78 Accepts]: Start accepts. Automaton has 76314 states and 80690 transitions. Word has length 955 [2025-03-16 15:21:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:21:57,529 INFO L471 AbstractCegarLoop]: Abstraction has 76314 states and 80690 transitions. [2025-03-16 15:21:57,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 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,529 INFO L276 IsEmpty]: Start isEmpty. Operand 76314 states and 80690 transitions. [2025-03-16 15:21:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2025-03-16 15:21:57,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:21:57,560 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:21:57,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 15:21:57,560 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:21:57,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:21:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1700705046, now seen corresponding path program 1 times [2025-03-16 15:21:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:21:57,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564559535] [2025-03-16 15:21:57,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:21:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:21:57,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-03-16 15:21:57,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-03-16 15:21:57,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:21:57,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:21:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 1062 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-16 15:21:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:21:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564559535] [2025-03-16 15:21:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564559535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:21:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:21:58,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:21:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791367555] [2025-03-16 15:21:58,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:21:58,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:21:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:21:58,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:21:58,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:21:58,350 INFO L87 Difference]: Start difference. First operand 76314 states and 80690 transitions. Second operand has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 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:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:00,326 INFO L93 Difference]: Finished difference Result 170085 states and 179621 transitions. [2025-03-16 15:22:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:00,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 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 960 [2025-03-16 15:22:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:00,428 INFO L225 Difference]: With dead ends: 170085 [2025-03-16 15:22:00,428 INFO L226 Difference]: Without dead ends: 93772 [2025-03-16 15:22:00,470 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:00,470 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 337 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:00,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 180 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:22:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93772 states. [2025-03-16 15:22:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93772 to 76314. [2025-03-16 15:22:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76314 states, 76313 states have (on average 1.0573558895601012) internal successors, (80690), 76313 states have internal predecessors, (80690), 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,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76314 states to 76314 states and 80690 transitions. [2025-03-16 15:22:01,207 INFO L78 Accepts]: Start accepts. Automaton has 76314 states and 80690 transitions. Word has length 960 [2025-03-16 15:22:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 76314 states and 80690 transitions. [2025-03-16 15:22:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 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,208 INFO L276 IsEmpty]: Start isEmpty. Operand 76314 states and 80690 transitions. [2025-03-16 15:22:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2025-03-16 15:22:01,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:01,239 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:22:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 15:22:01,239 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:01,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1248802584, now seen corresponding path program 1 times [2025-03-16 15:22:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502697395] [2025-03-16 15:22:01,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:01,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1047 statements into 1 equivalence classes. [2025-03-16 15:22:01,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1047 of 1047 statements. [2025-03-16 15:22:01,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:01,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1537 backedges. 1232 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-16 15:22:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:01,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502697395] [2025-03-16 15:22:01,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502697395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:01,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:01,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:22:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78245864] [2025-03-16 15:22:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:01,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:22:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:01,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:22:01,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:01,889 INFO L87 Difference]: Start difference. First operand 76314 states and 80690 transitions. Second operand has 5 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 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,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:04,418 INFO L93 Difference]: Finished difference Result 173908 states and 183805 transitions. [2025-03-16 15:22:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:22:04,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 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 1047 [2025-03-16 15:22:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:04,525 INFO L225 Difference]: With dead ends: 173908 [2025-03-16 15:22:04,525 INFO L226 Difference]: Without dead ends: 97595 [2025-03-16 15:22:04,574 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:04,574 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 736 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 3226 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 3226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:04,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 188 Invalid, 3633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 3226 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:22:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97595 states.