./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label08.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 b1b9d76937d81be7e84b48dddf4b490b52b3e309033b5807eced0086597e1f6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:03:22,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:03:22,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:03:22,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:03:22,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:03:22,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:03:22,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:03:22,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:03:22,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:03:22,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:03:22,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:03:22,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:03:22,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:03:22,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:03:22,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:03:22,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:03:22,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:03:22,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:03:22,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:03:22,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:03:22,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:03:22,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:03:22,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:03:22,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:03:22,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:03:22,759 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 -> b1b9d76937d81be7e84b48dddf4b490b52b3e309033b5807eced0086597e1f6f [2025-03-08 02:03:22,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:03:22,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:03:22,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:03:22,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:03:22,995 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:03:22,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label08.c [2025-03-08 02:03:24,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae93143/0352981ed1784351a45857fca0f318e1/FLAGb4c23f74e [2025-03-08 02:03:24,539 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:03:24,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label08.c [2025-03-08 02:03:24,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae93143/0352981ed1784351a45857fca0f318e1/FLAGb4c23f74e [2025-03-08 02:03:24,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dae93143/0352981ed1784351a45857fca0f318e1 [2025-03-08 02:03:24,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:03:24,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:03:24,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:03:24,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:03:24,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:03:24,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:03:24" (1/1) ... [2025-03-08 02:03:24,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64431e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:24, skipping insertion in model container [2025-03-08 02:03:24,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:03:24" (1/1) ... [2025-03-08 02:03:24,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:03:24,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label08.c[2006,2019] [2025-03-08 02:03:25,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:03:25,176 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:03:25,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label08.c[2006,2019] [2025-03-08 02:03:25,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:03:25,320 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:03:25,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25 WrapperNode [2025-03-08 02:03:25,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:03:25,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:03:25,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:03:25,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:03:25,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,449 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:03:25,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:03:25,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:03:25,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:03:25,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:03:25,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,512 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:03:25,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:03:25,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:03:25,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:03:25,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:03:25,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (1/1) ... [2025-03-08 02:03:25,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:03:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:03:25,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:03:25,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:03:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:03:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:03:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:03:25,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:03:25,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:03:25,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:03:27,140 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:03:27,200 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:03:27,200 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:03:27,218 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:03:27,218 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:03:27,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:27 BoogieIcfgContainer [2025-03-08 02:03:27,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:03:27,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:03:27,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:03:27,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:03:27,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:03:24" (1/3) ... [2025-03-08 02:03:27,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fc9998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:27, skipping insertion in model container [2025-03-08 02:03:27,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:25" (2/3) ... [2025-03-08 02:03:27,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fc9998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:27, skipping insertion in model container [2025-03-08 02:03:27,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:27" (3/3) ... [2025-03-08 02:03:27,226 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label08.c [2025-03-08 02:03:27,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:03:27,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label08.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:03:27,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:03:27,299 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;@4963db78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:03:27,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:03:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 02:03:27,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:27,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:27,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:27,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash -808687318, now seen corresponding path program 1 times [2025-03-08 02:03:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743401377] [2025-03-08 02:03:27,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:27,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 02:03:27,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 02:03:27,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:27,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743401377] [2025-03-08 02:03:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743401377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:27,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:27,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277467705] [2025-03-08 02:03:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:27,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:27,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:27,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:27,515 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:28,780 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-08 02:03:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:28,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-08 02:03:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:28,789 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 02:03:28,789 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:03:28,792 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-08 02:03:28,793 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 343 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:28,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:03:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:03:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:03:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-03-08 02:03:28,844 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 17 [2025-03-08 02:03:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:28,844 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-03-08 02:03:28,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-03-08 02:03:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 02:03:28,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:28,849 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:03:28,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:03:28,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:28,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1384389735, now seen corresponding path program 1 times [2025-03-08 02:03:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956127362] [2025-03-08 02:03:28,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:28,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 02:03:28,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 02:03:28,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:28,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:29,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:29,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956127362] [2025-03-08 02:03:29,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956127362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:29,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:29,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716095932] [2025-03-08 02:03:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:29,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:29,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:29,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:29,072 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:30,279 INFO L93 Difference]: Finished difference Result 1982 states and 3134 transitions. [2025-03-08 02:03:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:30,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-08 02:03:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:30,284 INFO L225 Difference]: With dead ends: 1982 [2025-03-08 02:03:30,285 INFO L226 Difference]: Without dead ends: 1322 [2025-03-08 02:03:30,290 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-08 02:03:30,290 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 279 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:30,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 78 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:03:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-08 02:03:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-03-08 02:03:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5064442759666414) internal successors, (1987), 1319 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1987 transitions. [2025-03-08 02:03:30,323 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1987 transitions. Word has length 88 [2025-03-08 02:03:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:30,323 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1987 transitions. [2025-03-08 02:03:30,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1987 transitions. [2025-03-08 02:03:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 02:03:30,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:30,325 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:03:30,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:03:30,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:30,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1491885135, now seen corresponding path program 1 times [2025-03-08 02:03:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:30,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260370322] [2025-03-08 02:03:30,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:30,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:30,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 02:03:30,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 02:03:30,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:30,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:30,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260370322] [2025-03-08 02:03:30,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260370322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:30,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:30,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194263948] [2025-03-08 02:03:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:30,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:30,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:30,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:30,472 INFO L87 Difference]: Start difference. First operand 1320 states and 1987 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:31,499 INFO L93 Difference]: Finished difference Result 3954 states and 5956 transitions. [2025-03-08 02:03:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-08 02:03:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:31,509 INFO L225 Difference]: With dead ends: 3954 [2025-03-08 02:03:31,510 INFO L226 Difference]: Without dead ends: 2636 [2025-03-08 02:03:31,515 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-08 02:03:31,516 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:31,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 205 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:03:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-08 02:03:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-03-08 02:03:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3240986717267553) internal successors, (3489), 2635 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3489 transitions. [2025-03-08 02:03:31,563 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3489 transitions. Word has length 92 [2025-03-08 02:03:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:31,564 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3489 transitions. [2025-03-08 02:03:31,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3489 transitions. [2025-03-08 02:03:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 02:03:31,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:31,570 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 02:03:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:03:31,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:31,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1305672694, now seen corresponding path program 1 times [2025-03-08 02:03:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844609288] [2025-03-08 02:03:31,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:31,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 02:03:31,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 02:03:31,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:31,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:03:31,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:31,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844609288] [2025-03-08 02:03:31,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844609288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:31,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:31,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460117277] [2025-03-08 02:03:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:31,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:31,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:31,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:31,796 INFO L87 Difference]: Start difference. First operand 2636 states and 3489 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 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-08 02:03:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:32,761 INFO L93 Difference]: Finished difference Result 6586 states and 8894 transitions. [2025-03-08 02:03:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 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 183 [2025-03-08 02:03:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:32,772 INFO L225 Difference]: With dead ends: 6586 [2025-03-08 02:03:32,772 INFO L226 Difference]: Without dead ends: 3952 [2025-03-08 02:03:32,775 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-08 02:03:32,776 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:32,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:03:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-08 02:03:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3294. [2025-03-08 02:03:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.3218949286365016) internal successors, (4353), 3293 states have internal predecessors, (4353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4353 transitions. [2025-03-08 02:03:32,823 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4353 transitions. Word has length 183 [2025-03-08 02:03:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:32,823 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4353 transitions. [2025-03-08 02:03:32,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 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-08 02:03:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4353 transitions. [2025-03-08 02:03:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-08 02:03:32,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:32,825 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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-08 02:03:32,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:03:32,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:32,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1950740392, now seen corresponding path program 1 times [2025-03-08 02:03:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:32,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178593762] [2025-03-08 02:03:32,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:32,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 02:03:32,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 02:03:32,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:32,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 02:03:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178593762] [2025-03-08 02:03:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178593762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642308693] [2025-03-08 02:03:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:33,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:33,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:33,026 INFO L87 Difference]: Start difference. First operand 3294 states and 4353 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:33,899 INFO L93 Difference]: Finished difference Result 7902 states and 10272 transitions. [2025-03-08 02:03:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:33,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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 259 [2025-03-08 02:03:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:33,911 INFO L225 Difference]: With dead ends: 7902 [2025-03-08 02:03:33,911 INFO L226 Difference]: Without dead ends: 4610 [2025-03-08 02:03:33,914 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-08 02:03:33,914 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:33,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 83 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:03:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-08 02:03:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-03-08 02:03:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.206552397483185) internal successors, (5561), 4609 states have internal predecessors, (5561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 5561 transitions. [2025-03-08 02:03:33,968 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 5561 transitions. Word has length 259 [2025-03-08 02:03:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:33,968 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 5561 transitions. [2025-03-08 02:03:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 5561 transitions. [2025-03-08 02:03:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-08 02:03:33,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:33,971 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:03:33,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:03:33,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:33,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash 680885499, now seen corresponding path program 1 times [2025-03-08 02:03:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:33,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537927502] [2025-03-08 02:03:33,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:33,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 02:03:34,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 02:03:34,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 02:03:34,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:34,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537927502] [2025-03-08 02:03:34,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537927502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:34,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:34,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:34,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891091931] [2025-03-08 02:03:34,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:34,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:34,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:34,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:34,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:34,498 INFO L87 Difference]: Start difference. First operand 4610 states and 5561 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:35,340 INFO L93 Difference]: Finished difference Result 9876 states and 11832 transitions. [2025-03-08 02:03:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:35,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 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 373 [2025-03-08 02:03:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:35,351 INFO L225 Difference]: With dead ends: 9876 [2025-03-08 02:03:35,351 INFO L226 Difference]: Without dead ends: 5268 [2025-03-08 02:03:35,356 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-08 02:03:35,357 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:35,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:03:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-08 02:03:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-03-08 02:03:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.187583064363015) internal successors, (6255), 5267 states have internal predecessors, (6255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 6255 transitions. [2025-03-08 02:03:35,410 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 6255 transitions. Word has length 373 [2025-03-08 02:03:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:35,410 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 6255 transitions. [2025-03-08 02:03:35,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 6255 transitions. [2025-03-08 02:03:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 02:03:35,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:35,415 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:35,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:03:35,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:35,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1947162336, now seen corresponding path program 1 times [2025-03-08 02:03:35,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:35,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363142491] [2025-03-08 02:03:35,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:35,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 02:03:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 02:03:35,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:35,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 02:03:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363142491] [2025-03-08 02:03:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363142491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:03:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207797762] [2025-03-08 02:03:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:35,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 02:03:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:35,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 02:03:35,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:03:35,903 INFO L87 Difference]: Start difference. First operand 5268 states and 6255 transitions. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:37,328 INFO L93 Difference]: Finished difference Result 9735 states and 11661 transitions. [2025-03-08 02:03:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 02:03:37,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 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 460 [2025-03-08 02:03:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:37,342 INFO L225 Difference]: With dead ends: 9735 [2025-03-08 02:03:37,342 INFO L226 Difference]: Without dead ends: 4939 [2025-03-08 02:03:37,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:03:37,347 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 307 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:37,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 287 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:03:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-08 02:03:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-08 02:03:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.071283920615634) internal successors, (5290), 4938 states have internal predecessors, (5290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5290 transitions. [2025-03-08 02:03:37,418 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5290 transitions. Word has length 460 [2025-03-08 02:03:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:37,419 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5290 transitions. [2025-03-08 02:03:37,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5290 transitions. [2025-03-08 02:03:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-08 02:03:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:37,428 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:03:37,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:03:37,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:37,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash 102982846, now seen corresponding path program 1 times [2025-03-08 02:03:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604354101] [2025-03-08 02:03:37,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:37,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 02:03:37,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 02:03:37,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:37,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 02:03:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604354101] [2025-03-08 02:03:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604354101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913227381] [2025-03-08 02:03:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:37,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:03:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:37,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:03:37,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:03:37,999 INFO L87 Difference]: Start difference. First operand 4939 states and 5290 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:38,792 INFO L93 Difference]: Finished difference Result 9218 states and 9909 transitions. [2025-03-08 02:03:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 488 [2025-03-08 02:03:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:38,803 INFO L225 Difference]: With dead ends: 9218 [2025-03-08 02:03:38,803 INFO L226 Difference]: Without dead ends: 4939 [2025-03-08 02:03:38,806 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-08 02:03:38,806 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 206 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:38,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 118 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:03:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-08 02:03:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-08 02:03:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.0702713649250708) internal successors, (5285), 4938 states have internal predecessors, (5285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5285 transitions. [2025-03-08 02:03:38,856 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5285 transitions. Word has length 488 [2025-03-08 02:03:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:38,856 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5285 transitions. [2025-03-08 02:03:38,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5285 transitions. [2025-03-08 02:03:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-08 02:03:38,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:38,864 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:38,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:03:38,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:38,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1339721067, now seen corresponding path program 1 times [2025-03-08 02:03:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:38,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446254525] [2025-03-08 02:03:38,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:38,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 02:03:38,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 02:03:38,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:38,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 02:03:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446254525] [2025-03-08 02:03:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446254525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:39,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792502489] [2025-03-08 02:03:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:39,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:39,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:39,307 INFO L87 Difference]: Start difference. First operand 4939 states and 5285 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:40,024 INFO L93 Difference]: Finished difference Result 11850 states and 12799 transitions. [2025-03-08 02:03:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:40,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 592 [2025-03-08 02:03:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:40,036 INFO L225 Difference]: With dead ends: 11850 [2025-03-08 02:03:40,036 INFO L226 Difference]: Without dead ends: 7571 [2025-03-08 02:03:40,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:40,042 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 224 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:40,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 38 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:03:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-03-08 02:03:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2025-03-08 02:03:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.0718626155878468) internal successors, (8114), 7570 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8114 transitions. [2025-03-08 02:03:40,104 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8114 transitions. Word has length 592 [2025-03-08 02:03:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:40,104 INFO L471 AbstractCegarLoop]: Abstraction has 7571 states and 8114 transitions. [2025-03-08 02:03:40,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8114 transitions. [2025-03-08 02:03:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-03-08 02:03:40,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:40,110 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:40,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:03:40,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:40,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash -250332734, now seen corresponding path program 1 times [2025-03-08 02:03:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547499413] [2025-03-08 02:03:40,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:40,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-08 02:03:40,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-08 02:03:40,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:40,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2025-03-08 02:03:40,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:40,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547499413] [2025-03-08 02:03:40,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547499413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:40,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:40,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29674974] [2025-03-08 02:03:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:40,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:40,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:40,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:40,409 INFO L87 Difference]: Start difference. First operand 7571 states and 8114 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:41,086 INFO L93 Difference]: Finished difference Result 17114 states and 18457 transitions. [2025-03-08 02:03:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 681 [2025-03-08 02:03:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:41,100 INFO L225 Difference]: With dead ends: 17114 [2025-03-08 02:03:41,101 INFO L226 Difference]: Without dead ends: 10203 [2025-03-08 02:03:41,107 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-08 02:03:41,107 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:41,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 437 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2025-03-08 02:03:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 9216. [2025-03-08 02:03:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0637004883342376) internal successors, (9802), 9215 states have internal predecessors, (9802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9802 transitions. [2025-03-08 02:03:41,182 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9802 transitions. Word has length 681 [2025-03-08 02:03:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:41,183 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9802 transitions. [2025-03-08 02:03:41,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9802 transitions. [2025-03-08 02:03:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-03-08 02:03:41,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:41,188 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:41,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:03:41,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:41,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1177534440, now seen corresponding path program 1 times [2025-03-08 02:03:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:41,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142409986] [2025-03-08 02:03:41,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:41,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-08 02:03:41,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-08 02:03:41,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:41,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-03-08 02:03:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:41,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142409986] [2025-03-08 02:03:41,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142409986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:41,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:41,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116984842] [2025-03-08 02:03:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:41,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:41,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:41,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:41,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:41,776 INFO L87 Difference]: Start difference. First operand 9216 states and 9802 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:42,316 INFO L93 Difference]: Finished difference Result 17772 states and 18938 transitions. [2025-03-08 02:03:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:42,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 682 [2025-03-08 02:03:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:42,328 INFO L225 Difference]: With dead ends: 17772 [2025-03-08 02:03:42,328 INFO L226 Difference]: Without dead ends: 9216 [2025-03-08 02:03:42,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-08 02:03:42,335 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 350 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:42,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 377 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-03-08 02:03:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216. [2025-03-08 02:03:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9216 states, 9215 states have (on average 1.0569723277265328) internal successors, (9740), 9215 states have internal predecessors, (9740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9740 transitions. [2025-03-08 02:03:42,412 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9740 transitions. Word has length 682 [2025-03-08 02:03:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:42,413 INFO L471 AbstractCegarLoop]: Abstraction has 9216 states and 9740 transitions. [2025-03-08 02:03:42,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9740 transitions. [2025-03-08 02:03:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-08 02:03:42,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:42,422 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:42,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:03:42,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1203953346, now seen corresponding path program 1 times [2025-03-08 02:03:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:42,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058162599] [2025-03-08 02:03:42,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:42,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:42,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-03-08 02:03:42,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-03-08 02:03:42,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:42,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 676 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2025-03-08 02:03:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058162599] [2025-03-08 02:03:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058162599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:42,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333787699] [2025-03-08 02:03:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:42,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:42,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:42,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:42,752 INFO L87 Difference]: Start difference. First operand 9216 states and 9740 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:43,301 INFO L93 Difference]: Finished difference Result 21720 states and 23082 transitions. [2025-03-08 02:03:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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 817 [2025-03-08 02:03:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:43,319 INFO L225 Difference]: With dead ends: 21720 [2025-03-08 02:03:43,319 INFO L226 Difference]: Without dead ends: 12835 [2025-03-08 02:03:43,326 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-08 02:03:43,327 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 271 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:43,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 429 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-03-08 02:03:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 11848. [2025-03-08 02:03:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.049379589769562) internal successors, (12432), 11847 states have internal predecessors, (12432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12432 transitions. [2025-03-08 02:03:43,418 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12432 transitions. Word has length 817 [2025-03-08 02:03:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:43,419 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12432 transitions. [2025-03-08 02:03:43,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12432 transitions. [2025-03-08 02:03:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1087 [2025-03-08 02:03:43,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:43,432 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:43,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:03:43,433 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:43,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash 398209490, now seen corresponding path program 1 times [2025-03-08 02:03:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19658499] [2025-03-08 02:03:43,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:43,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1086 statements into 1 equivalence classes. [2025-03-08 02:03:43,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1086 of 1086 statements. [2025-03-08 02:03:43,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:43,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 1408 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-08 02:03:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19658499] [2025-03-08 02:03:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19658499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:44,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:03:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044237827] [2025-03-08 02:03:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:44,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:03:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:44,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:03:44,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:03:44,327 INFO L87 Difference]: Start difference. First operand 11848 states and 12432 transitions. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:45,319 INFO L93 Difference]: Finished difference Result 23695 states and 24884 transitions. [2025-03-08 02:03:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:03:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 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 1086 [2025-03-08 02:03:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:45,330 INFO L225 Difference]: With dead ends: 23695 [2025-03-08 02:03:45,330 INFO L226 Difference]: Without dead ends: 12507 [2025-03-08 02:03:45,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:03:45,337 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 284 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:45,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 455 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:03:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12507 states. [2025-03-08 02:03:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12507 to 12506. [2025-03-08 02:03:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0471811275489804) internal successors, (13095), 12505 states have internal predecessors, (13095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13095 transitions. [2025-03-08 02:03:45,430 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13095 transitions. Word has length 1086 [2025-03-08 02:03:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:45,431 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 13095 transitions. [2025-03-08 02:03:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13095 transitions. [2025-03-08 02:03:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1101 [2025-03-08 02:03:45,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:45,447 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:03:45,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:03:45,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:45,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1949021864, now seen corresponding path program 1 times [2025-03-08 02:03:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407354004] [2025-03-08 02:03:45,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:45,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1100 statements into 1 equivalence classes. [2025-03-08 02:03:45,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1100 of 1100 statements. [2025-03-08 02:03:45,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:45,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 1275 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2025-03-08 02:03:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407354004] [2025-03-08 02:03:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407354004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:46,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:03:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080313004] [2025-03-08 02:03:46,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:46,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:03:46,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:46,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:03:46,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:03:46,326 INFO L87 Difference]: Start difference. First operand 12506 states and 13095 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-08 02:03:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:47,051 INFO L93 Difference]: Finished difference Result 24364 states and 25536 transitions. [2025-03-08 02:03:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:03:47,052 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 1100 [2025-03-08 02:03:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:47,064 INFO L225 Difference]: With dead ends: 24364 [2025-03-08 02:03:47,064 INFO L226 Difference]: Without dead ends: 12518 [2025-03-08 02:03:47,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:03:47,072 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:47,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 450 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:03:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12518 states. [2025-03-08 02:03:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12518 to 12177. [2025-03-08 02:03:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0477168199737188) internal successors, (12757), 12176 states have internal predecessors, (12757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12757 transitions. [2025-03-08 02:03:47,196 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12757 transitions. Word has length 1100 [2025-03-08 02:03:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:47,198 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12757 transitions. [2025-03-08 02:03:47,198 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-08 02:03:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12757 transitions. [2025-03-08 02:03:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2025-03-08 02:03:47,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:47,211 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:47,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:03:47,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:47,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:47,212 INFO L85 PathProgramCache]: Analyzing trace with hash -223069523, now seen corresponding path program 1 times [2025-03-08 02:03:47,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:47,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110576345] [2025-03-08 02:03:47,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:47,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1102 statements into 1 equivalence classes. [2025-03-08 02:03:47,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1102 of 1102 statements. [2025-03-08 02:03:47,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:47,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2322 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-08 02:03:47,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110576345] [2025-03-08 02:03:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110576345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:47,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:47,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572332878] [2025-03-08 02:03:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:47,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:47,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:47,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:47,723 INFO L87 Difference]: Start difference. First operand 12177 states and 12757 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:48,347 INFO L93 Difference]: Finished difference Result 26326 states and 27644 transitions. [2025-03-08 02:03:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1102 [2025-03-08 02:03:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:48,359 INFO L225 Difference]: With dead ends: 26326 [2025-03-08 02:03:48,359 INFO L226 Difference]: Without dead ends: 13164 [2025-03-08 02:03:48,367 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-08 02:03:48,368 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 273 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:48,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 417 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-08 02:03:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 11848. [2025-03-08 02:03:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0394192622604879) internal successors, (12314), 11847 states have internal predecessors, (12314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12314 transitions. [2025-03-08 02:03:48,465 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12314 transitions. Word has length 1102 [2025-03-08 02:03:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:48,465 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12314 transitions. [2025-03-08 02:03:48,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12314 transitions. [2025-03-08 02:03:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1235 [2025-03-08 02:03:48,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:48,479 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:48,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:03:48,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:48,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1884192138, now seen corresponding path program 1 times [2025-03-08 02:03:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366904702] [2025-03-08 02:03:48,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:48,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1234 statements into 1 equivalence classes. [2025-03-08 02:03:48,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1234 of 1234 statements. [2025-03-08 02:03:48,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:48,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3149 backedges. 2162 proven. 0 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2025-03-08 02:03:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366904702] [2025-03-08 02:03:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366904702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:48,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476433196] [2025-03-08 02:03:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:48,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:48,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:48,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:48,953 INFO L87 Difference]: Start difference. First operand 11848 states and 12314 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:49,500 INFO L93 Difference]: Finished difference Result 23365 states and 24292 transitions. [2025-03-08 02:03:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 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 1234 [2025-03-08 02:03:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:49,511 INFO L225 Difference]: With dead ends: 23365 [2025-03-08 02:03:49,511 INFO L226 Difference]: Without dead ends: 11848 [2025-03-08 02:03:49,518 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-08 02:03:49,518 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:49,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 426 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2025-03-08 02:03:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11519. [2025-03-08 02:03:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0309949644035423) internal successors, (11875), 11518 states have internal predecessors, (11875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 11875 transitions. [2025-03-08 02:03:49,602 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 11875 transitions. Word has length 1234 [2025-03-08 02:03:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:49,603 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 11875 transitions. [2025-03-08 02:03:49,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 11875 transitions. [2025-03-08 02:03:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1260 [2025-03-08 02:03:49,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:49,617 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:03:49,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:49,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1489071501, now seen corresponding path program 1 times [2025-03-08 02:03:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751993260] [2025-03-08 02:03:49,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:49,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1259 statements into 1 equivalence classes. [2025-03-08 02:03:49,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1259 of 1259 statements. [2025-03-08 02:03:49,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:49,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3301 backedges. 1906 proven. 0 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2025-03-08 02:03:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:50,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751993260] [2025-03-08 02:03:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751993260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:50,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:50,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636422593] [2025-03-08 02:03:50,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:50,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:50,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:50,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:50,476 INFO L87 Difference]: Start difference. First operand 11519 states and 11875 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:51,077 INFO L93 Difference]: Finished difference Result 23036 states and 23753 transitions. [2025-03-08 02:03:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:51,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1259 [2025-03-08 02:03:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:51,087 INFO L225 Difference]: With dead ends: 23036 [2025-03-08 02:03:51,087 INFO L226 Difference]: Without dead ends: 12177 [2025-03-08 02:03:51,093 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-08 02:03:51,094 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:51,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 435 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2025-03-08 02:03:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2025-03-08 02:03:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.02973061760841) internal successors, (12538), 12176 states have internal predecessors, (12538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12538 transitions. [2025-03-08 02:03:51,169 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12538 transitions. Word has length 1259 [2025-03-08 02:03:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:51,170 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12538 transitions. [2025-03-08 02:03:51,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12538 transitions. [2025-03-08 02:03:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1285 [2025-03-08 02:03:51,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:51,183 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:51,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:03:51,183 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:51,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1062872669, now seen corresponding path program 1 times [2025-03-08 02:03:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423415372] [2025-03-08 02:03:51,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:51,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:51,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1284 statements into 1 equivalence classes. [2025-03-08 02:03:51,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1284 of 1284 statements. [2025-03-08 02:03:51,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:51,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2885 backedges. 1994 proven. 0 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2025-03-08 02:03:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:52,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423415372] [2025-03-08 02:03:52,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423415372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:52,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:03:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265577068] [2025-03-08 02:03:52,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:03:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:52,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:03:52,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:03:52,160 INFO L87 Difference]: Start difference. First operand 12177 states and 12538 transitions. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:52,909 INFO L93 Difference]: Finished difference Result 23694 states and 24410 transitions. [2025-03-08 02:03:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:03:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1284 [2025-03-08 02:03:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:52,921 INFO L225 Difference]: With dead ends: 23694 [2025-03-08 02:03:52,921 INFO L226 Difference]: Without dead ends: 12177 [2025-03-08 02:03:52,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:03:52,929 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:52,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 560 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:03:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2025-03-08 02:03:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2025-03-08 02:03:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0287450722733247) internal successors, (12526), 12176 states have internal predecessors, (12526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12526 transitions. [2025-03-08 02:03:53,006 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12526 transitions. Word has length 1284 [2025-03-08 02:03:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:53,006 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12526 transitions. [2025-03-08 02:03:53,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12526 transitions. [2025-03-08 02:03:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1314 [2025-03-08 02:03:53,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:53,019 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:53,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:03:53,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2076130776, now seen corresponding path program 1 times [2025-03-08 02:03:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139301436] [2025-03-08 02:03:53,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:53,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1313 statements into 1 equivalence classes. [2025-03-08 02:03:53,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1313 of 1313 statements. [2025-03-08 02:03:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3320 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-08 02:03:53,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139301436] [2025-03-08 02:03:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139301436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:53,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339738622] [2025-03-08 02:03:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:53,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:53,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:53,565 INFO L87 Difference]: Start difference. First operand 12177 states and 12526 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:54,101 INFO L93 Difference]: Finished difference Result 25339 states and 26086 transitions. [2025-03-08 02:03:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:54,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 1313 [2025-03-08 02:03:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:54,112 INFO L225 Difference]: With dead ends: 25339 [2025-03-08 02:03:54,112 INFO L226 Difference]: Without dead ends: 13164 [2025-03-08 02:03:54,118 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-08 02:03:54,118 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 267 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:54,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 414 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-08 02:03:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12506. [2025-03-08 02:03:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0225509796081567) internal successors, (12787), 12505 states have internal predecessors, (12787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12787 transitions. [2025-03-08 02:03:54,196 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12787 transitions. Word has length 1313 [2025-03-08 02:03:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:54,197 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12787 transitions. [2025-03-08 02:03:54,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:03:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12787 transitions. [2025-03-08 02:03:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2025-03-08 02:03:54,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:54,212 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:03:54,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:03:54,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:54,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2018261500, now seen corresponding path program 1 times [2025-03-08 02:03:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:54,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547471148] [2025-03-08 02:03:54,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:54,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes. [2025-03-08 02:03:54,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1542 of 1542 statements. [2025-03-08 02:03:54,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:54,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4074 backedges. 2508 proven. 66 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2025-03-08 02:03:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547471148] [2025-03-08 02:03:55,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547471148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:03:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335147694] [2025-03-08 02:03:55,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:03:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:03:55,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:03:55,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:03:55,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes. [2025-03-08 02:03:55,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1542 of 1542 statements. [2025-03-08 02:03:55,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:55,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:55,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:03:55,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:03:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4074 backedges. 1987 proven. 201 refuted. 0 times theorem prover too weak. 1886 trivial. 0 not checked. [2025-03-08 02:03:57,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:04:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4074 backedges. 1987 proven. 201 refuted. 0 times theorem prover too weak. 1886 trivial. 0 not checked. [2025-03-08 02:04:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335147694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:04:00,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:04:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-08 02:04:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706481919] [2025-03-08 02:04:00,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:04:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:04:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:00,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:04:00,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:04:00,736 INFO L87 Difference]: Start difference. First operand 12506 states and 12787 transitions. Second operand has 9 states, 9 states have (on average 195.22222222222223) internal successors, (1757), 8 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:04,193 INFO L93 Difference]: Finished difference Result 35867 states and 36721 transitions. [2025-03-08 02:04:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 02:04:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 195.22222222222223) internal successors, (1757), 8 states have internal predecessors, (1757), 0 states have call successors, (0), 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 1542 [2025-03-08 02:04:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:04,213 INFO L225 Difference]: With dead ends: 35867 [2025-03-08 02:04:04,213 INFO L226 Difference]: Without dead ends: 24021 [2025-03-08 02:04:04,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3094 GetRequests, 3079 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-08 02:04:04,220 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1932 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5908 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 5908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:04,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1932 Valid, 75 Invalid, 6270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 5908 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 02:04:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2025-03-08 02:04:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 18428. [2025-03-08 02:04:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0217072773647364) internal successors, (18827), 18427 states have internal predecessors, (18827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18827 transitions. [2025-03-08 02:04:04,371 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18827 transitions. Word has length 1542 [2025-03-08 02:04:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:04,372 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18827 transitions. [2025-03-08 02:04:04,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 195.22222222222223) internal successors, (1757), 8 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18827 transitions. [2025-03-08 02:04:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1636 [2025-03-08 02:04:04,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:04,391 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:04:04,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:04:04,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:04,592 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1809631526, now seen corresponding path program 1 times [2025-03-08 02:04:04,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:04,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393167327] [2025-03-08 02:04:04,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:04,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1635 statements into 1 equivalence classes. [2025-03-08 02:04:04,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1635 of 1635 statements. [2025-03-08 02:04:04,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:04,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4910 backedges. 2845 proven. 0 refuted. 0 times theorem prover too weak. 2065 trivial. 0 not checked. [2025-03-08 02:04:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:05,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393167327] [2025-03-08 02:04:05,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393167327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:05,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:05,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:05,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574198103] [2025-03-08 02:04:05,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:05,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:05,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:05,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:05,873 INFO L87 Difference]: Start difference. First operand 18428 states and 18827 transitions. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:06,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:06,456 INFO L93 Difference]: Finished difference Result 38828 states and 39674 transitions. [2025-03-08 02:04:06,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:06,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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 1635 [2025-03-08 02:04:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:06,477 INFO L225 Difference]: With dead ends: 38828 [2025-03-08 02:04:06,477 INFO L226 Difference]: Without dead ends: 21060 [2025-03-08 02:04:06,488 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-08 02:04:06,488 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:06,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 45 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-08 02:04:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 20073. [2025-03-08 02:04:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0212734157034675) internal successors, (20499), 20072 states have internal predecessors, (20499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20499 transitions. [2025-03-08 02:04:06,666 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20499 transitions. Word has length 1635 [2025-03-08 02:04:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:06,667 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20499 transitions. [2025-03-08 02:04:06,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20499 transitions. [2025-03-08 02:04:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1677 [2025-03-08 02:04:06,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:06,688 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:04:06,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:04:06,688 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash 68754549, now seen corresponding path program 1 times [2025-03-08 02:04:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7135348] [2025-03-08 02:04:06,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:06,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1676 statements into 1 equivalence classes. [2025-03-08 02:04:06,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1676 of 1676 statements. [2025-03-08 02:04:06,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:06,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5532 backedges. 3920 proven. 41 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [2025-03-08 02:04:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7135348] [2025-03-08 02:04:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7135348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986537143] [2025-03-08 02:04:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:08,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:08,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:04:08,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1676 statements into 1 equivalence classes. [2025-03-08 02:04:09,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1676 of 1676 statements. [2025-03-08 02:04:09,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:09,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:09,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:04:09,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5532 backedges. 2578 proven. 0 refuted. 0 times theorem prover too weak. 2954 trivial. 0 not checked. [2025-03-08 02:04:09,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986537143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:04:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438263874] [2025-03-08 02:04:09,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:09,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:09,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:09,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:04:09,583 INFO L87 Difference]: Start difference. First operand 20073 states and 20499 transitions. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:10,114 INFO L93 Difference]: Finished difference Result 39486 states and 40334 transitions. [2025-03-08 02:04:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:10,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 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 1676 [2025-03-08 02:04:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:10,134 INFO L225 Difference]: With dead ends: 39486 [2025-03-08 02:04:10,134 INFO L226 Difference]: Without dead ends: 20073 [2025-03-08 02:04:10,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1680 GetRequests, 1676 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-08 02:04:10,146 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:10,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 425 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-08 02:04:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 20073. [2025-03-08 02:04:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0210741331207653) internal successors, (20495), 20072 states have internal predecessors, (20495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20495 transitions. [2025-03-08 02:04:10,349 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20495 transitions. Word has length 1676 [2025-03-08 02:04:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:10,350 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20495 transitions. [2025-03-08 02:04:10,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20495 transitions. [2025-03-08 02:04:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1907 [2025-03-08 02:04:10,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:10,376 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:04:10,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 02:04:10,580 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,SelfDestructingSolverStorable21 [2025-03-08 02:04:10,580 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1454885078, now seen corresponding path program 1 times [2025-03-08 02:04:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592880183] [2025-03-08 02:04:10,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:10,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1906 statements into 1 equivalence classes. [2025-03-08 02:04:10,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1906 of 1906 statements. [2025-03-08 02:04:10,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:10,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 4706 proven. 665 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2025-03-08 02:04:13,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:13,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592880183] [2025-03-08 02:04:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592880183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:13,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551117767] [2025-03-08 02:04:13,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:13,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:13,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:13,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:13,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:04:13,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1906 statements into 1 equivalence classes. [2025-03-08 02:04:13,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1906 of 1906 statements. [2025-03-08 02:04:13,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:13,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:13,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 2206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:04:14,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 2995 proven. 0 refuted. 0 times theorem prover too weak. 3841 trivial. 0 not checked. [2025-03-08 02:04:14,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551117767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-08 02:04:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798256332] [2025-03-08 02:04:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:14,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:14,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:14,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 02:04:14,183 INFO L87 Difference]: Start difference. First operand 20073 states and 20495 transitions. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:14,701 INFO L93 Difference]: Finished difference Result 39486 states and 40326 transitions. [2025-03-08 02:04:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:14,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 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 1906 [2025-03-08 02:04:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:14,720 INFO L225 Difference]: With dead ends: 39486 [2025-03-08 02:04:14,720 INFO L226 Difference]: Without dead ends: 20073 [2025-03-08 02:04:14,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1915 GetRequests, 1906 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 02:04:14,732 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:14,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 415 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-08 02:04:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 18757. [2025-03-08 02:04:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0178609511622947) internal successors, (19091), 18756 states have internal predecessors, (19091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19091 transitions. [2025-03-08 02:04:14,869 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19091 transitions. Word has length 1906 [2025-03-08 02:04:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:14,870 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19091 transitions. [2025-03-08 02:04:14,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19091 transitions. [2025-03-08 02:04:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2318 [2025-03-08 02:04:14,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:14,899 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:14,906 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-08 02:04:15,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:15,099 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1697936174, now seen corresponding path program 1 times [2025-03-08 02:04:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:15,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34955492] [2025-03-08 02:04:15,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:15,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2317 statements into 1 equivalence classes. [2025-03-08 02:04:15,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2317 of 2317 statements. [2025-03-08 02:04:15,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:15,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10276 backedges. 7175 proven. 153 refuted. 0 times theorem prover too weak. 2948 trivial. 0 not checked. [2025-03-08 02:04:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34955492] [2025-03-08 02:04:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34955492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938283177] [2025-03-08 02:04:17,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:17,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:17,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:17,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:17,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:04:17,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2317 statements into 1 equivalence classes. [2025-03-08 02:04:18,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2317 of 2317 statements. [2025-03-08 02:04:18,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:18,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:18,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:04:18,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10276 backedges. 5657 proven. 0 refuted. 0 times theorem prover too weak. 4619 trivial. 0 not checked. [2025-03-08 02:04:18,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938283177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:18,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:18,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:04:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138277091] [2025-03-08 02:04:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:18,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:18,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:18,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:04:18,208 INFO L87 Difference]: Start difference. First operand 18757 states and 19091 transitions. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:18,828 INFO L93 Difference]: Finished difference Result 38828 states and 39532 transitions. [2025-03-08 02:04:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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 2317 [2025-03-08 02:04:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:18,846 INFO L225 Difference]: With dead ends: 38828 [2025-03-08 02:04:18,846 INFO L226 Difference]: Without dead ends: 20731 [2025-03-08 02:04:18,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2322 GetRequests, 2317 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:04:18,858 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:18,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 426 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-03-08 02:04:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 19744. [2025-03-08 02:04:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0174745479410423) internal successors, (20088), 19743 states have internal predecessors, (20088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20088 transitions. [2025-03-08 02:04:19,060 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20088 transitions. Word has length 2317 [2025-03-08 02:04:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:19,061 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20088 transitions. [2025-03-08 02:04:19,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20088 transitions. [2025-03-08 02:04:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2349 [2025-03-08 02:04:19,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:19,118 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:04:19,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 02:04:19,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:19,318 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:19,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1962544480, now seen corresponding path program 1 times [2025-03-08 02:04:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:19,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893182398] [2025-03-08 02:04:19,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:19,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:19,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2348 statements into 1 equivalence classes. [2025-03-08 02:04:19,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2348 of 2348 statements. [2025-03-08 02:04:19,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10732 backedges. 7802 proven. 91 refuted. 0 times theorem prover too weak. 2839 trivial. 0 not checked. [2025-03-08 02:04:21,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893182398] [2025-03-08 02:04:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893182398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474176757] [2025-03-08 02:04:21,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:21,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:21,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:21,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:04:22,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2348 statements into 1 equivalence classes. [2025-03-08 02:04:22,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2348 of 2348 statements. [2025-03-08 02:04:22,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:22,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:22,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 2693 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 02:04:22,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10732 backedges. 6295 proven. 510 refuted. 0 times theorem prover too weak. 3927 trivial. 0 not checked. [2025-03-08 02:04:24,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:04:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10732 backedges. 6295 proven. 510 refuted. 0 times theorem prover too weak. 3927 trivial. 0 not checked. [2025-03-08 02:04:26,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474176757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:04:26,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:04:26,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 02:04:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709901924] [2025-03-08 02:04:26,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:04:26,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:04:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:26,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:04:26,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:04:26,593 INFO L87 Difference]: Start difference. First operand 19744 states and 20088 transitions. Second operand has 9 states, 9 states have (on average 158.11111111111111) internal successors, (1423), 9 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:29,256 INFO L93 Difference]: Finished difference Result 39158 states and 39845 transitions. [2025-03-08 02:04:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 02:04:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 158.11111111111111) internal successors, (1423), 9 states have internal predecessors, (1423), 0 states have call successors, (0), 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 2348 [2025-03-08 02:04:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:29,273 INFO L225 Difference]: With dead ends: 39158 [2025-03-08 02:04:29,273 INFO L226 Difference]: Without dead ends: 20074 [2025-03-08 02:04:29,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4708 GetRequests, 4696 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-08 02:04:29,284 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1004 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 7349 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 7384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 7349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:29,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 878 Invalid, 7384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 7349 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 02:04:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20074 states. [2025-03-08 02:04:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20074 to 19744. [2025-03-08 02:04:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0163602289419034) internal successors, (20066), 19743 states have internal predecessors, (20066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20066 transitions. [2025-03-08 02:04:29,430 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20066 transitions. Word has length 2348 [2025-03-08 02:04:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:29,431 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20066 transitions. [2025-03-08 02:04:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 158.11111111111111) internal successors, (1423), 9 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20066 transitions. [2025-03-08 02:04:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2507 [2025-03-08 02:04:29,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:29,507 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:04:29,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:04:29,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 02:04:29,708 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash 779409181, now seen corresponding path program 1 times [2025-03-08 02:04:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:29,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67354765] [2025-03-08 02:04:29,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:29,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2506 statements into 1 equivalence classes. [2025-03-08 02:04:29,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2506 of 2506 statements. [2025-03-08 02:04:29,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:29,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10794 backedges. 7609 proven. 153 refuted. 0 times theorem prover too weak. 3032 trivial. 0 not checked. [2025-03-08 02:04:32,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67354765] [2025-03-08 02:04:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67354765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422894173] [2025-03-08 02:04:32,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:32,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:32,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 02:04:32,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2506 statements into 1 equivalence classes. [2025-03-08 02:04:32,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2506 of 2506 statements. [2025-03-08 02:04:32,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:32,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:33,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 2841 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:04:33,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10794 backedges. 7103 proven. 67 refuted. 0 times theorem prover too weak. 3624 trivial. 0 not checked. [2025-03-08 02:04:38,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:04:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10794 backedges. 6049 proven. 0 refuted. 0 times theorem prover too weak. 4745 trivial. 0 not checked. [2025-03-08 02:04:41,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422894173] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:41,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:04:41,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-08 02:04:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848666940] [2025-03-08 02:04:41,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:41,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:41,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:41,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:41,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:04:41,607 INFO L87 Difference]: Start difference. First operand 19744 states and 20066 transitions. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:42,265 INFO L93 Difference]: Finished difference Result 40473 states and 41139 transitions. [2025-03-08 02:04:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:42,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 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 2506 [2025-03-08 02:04:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:42,283 INFO L225 Difference]: With dead ends: 40473 [2025-03-08 02:04:42,283 INFO L226 Difference]: Without dead ends: 21389 [2025-03-08 02:04:42,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5016 GetRequests, 5009 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:04:42,295 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 267 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:42,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 31 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21389 states. [2025-03-08 02:04:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 19744. [2025-03-08 02:04:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0156511168515423) internal successors, (20052), 19743 states have internal predecessors, (20052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20052 transitions. [2025-03-08 02:04:42,452 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20052 transitions. Word has length 2506 [2025-03-08 02:04:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:42,453 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20052 transitions. [2025-03-08 02:04:42,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:04:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20052 transitions. [2025-03-08 02:04:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2511 [2025-03-08 02:04:42,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:42,486 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-08 02:04:42,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 02:04:42,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 02:04:42,686 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:42,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash -45662417, now seen corresponding path program 1 times [2025-03-08 02:04:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389455108] [2025-03-08 02:04:42,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:42,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2510 statements into 1 equivalence classes. [2025-03-08 02:04:42,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2510 of 2510 statements. [2025-03-08 02:04:42,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:42,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat