./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label17.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/Problem17_label17.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 ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:08:51,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:08:51,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:08:51,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:08:51,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:08:51,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:08:51,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:08:51,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:08:51,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:08:51,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:08:51,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:08:51,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:08:51,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:08:51,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:08:51,943 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:08:51,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:08:51,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:08:51,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:08:51,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:08:51,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:08:51,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:08:51,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:08:51,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:08:51,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:08:51,947 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 -> ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f [2025-03-08 02:08:52,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:08:52,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:08:52,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:08:52,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:08:52,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:08:52,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2025-03-08 02:08:53,328 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59a483ee/7163bdd2c96d4f039418bb62bc0b9ec5/FLAG0c480071b [2025-03-08 02:08:53,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:08:53,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2025-03-08 02:08:53,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59a483ee/7163bdd2c96d4f039418bb62bc0b9ec5/FLAG0c480071b [2025-03-08 02:08:53,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59a483ee/7163bdd2c96d4f039418bb62bc0b9ec5 [2025-03-08 02:08:53,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:08:53,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:08:53,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:08:53,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:08:53,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:08:53,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:53, skipping insertion in model container [2025-03-08 02:08:53,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:08:53" (1/1) ... [2025-03-08 02:08:53,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:08:54,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c[5781,5794] [2025-03-08 02:08:54,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:08:54,401 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:08:54,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c[5781,5794] [2025-03-08 02:08:54,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:08:54,614 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:08:54,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54 WrapperNode [2025-03-08 02:08:54,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:08:54,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:08:54,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:08:54,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:08:54,620 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:08:54" (1/1) ... [2025-03-08 02:08:54,652 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:08:54" (1/1) ... [2025-03-08 02:08:54,844 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:08:54,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:08:54,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:08:54,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:08:54,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:08:54,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:54,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:54,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,051 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:08:55,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:08:55,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:08:55,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:08:55,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:08:55,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (1/1) ... [2025-03-08 02:08:55,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:08:55,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:55,249 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:08:55,256 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:08:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:08:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:08:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:08:55,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:08:55,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:08:55,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:08:57,935 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:08:58,080 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:08:58,081 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:08:58,111 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:08:58,112 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:08:58,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:58 BoogieIcfgContainer [2025-03-08 02:08:58,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:08:58,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:08:58,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:08:58,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:08:58,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:08:53" (1/3) ... [2025-03-08 02:08:58,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e258af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:58, skipping insertion in model container [2025-03-08 02:08:58,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:08:54" (2/3) ... [2025-03-08 02:08:58,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e258af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:08:58, skipping insertion in model container [2025-03-08 02:08:58,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:08:58" (3/3) ... [2025-03-08 02:08:58,119 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label17.c [2025-03-08 02:08:58,136 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:08:58,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label17.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:08:58,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:08:58,210 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;@2aa6fa63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:08:58,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:08:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states 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:08:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 02:08:58,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:58,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:58,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:58,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash -53292530, now seen corresponding path program 1 times [2025-03-08 02:08:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146223068] [2025-03-08 02:08:58,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:58,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 02:08:58,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 02:08:58,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:58,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:58,510 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:08:58,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146223068] [2025-03-08 02:08:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146223068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:58,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:58,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:08:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790398212] [2025-03-08 02:08:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:58,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:58,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:58,530 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:09:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:00,498 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-08 02:09:00,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:00,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 02:09:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:00,513 INFO L225 Difference]: With dead ends: 1644 [2025-03-08 02:09:00,513 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 02:09:00,516 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:09:00,518 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 450 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:00,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:09:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 02:09:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-08 02:09:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states 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:09:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-08 02:09:00,597 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 38 [2025-03-08 02:09:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:00,597 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-08 02:09:00,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:09:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-08 02:09:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 02:09:00,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:00,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:00,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:09:00,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:00,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1425897744, now seen corresponding path program 1 times [2025-03-08 02:09:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163208097] [2025-03-08 02:09:00,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:00,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 02:09:00,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 02:09:00,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:00,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163208097] [2025-03-08 02:09:00,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163208097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:00,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:00,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998496096] [2025-03-08 02:09:00,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:00,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:00,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:00,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:00,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:00,806 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:09:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:02,547 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-03-08 02:09:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:02,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-08 02:09:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:02,553 INFO L225 Difference]: With dead ends: 2813 [2025-03-08 02:09:02,553 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:09:02,555 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:09:02,555 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:02,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:09:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:09:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-03-08 02:09:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-03-08 02:09:02,595 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 105 [2025-03-08 02:09:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:02,595 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-03-08 02:09:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:09:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-03-08 02:09:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 02:09:02,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:02,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:02,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:09:02,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1849911850, now seen corresponding path program 1 times [2025-03-08 02:09:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212116747] [2025-03-08 02:09:02,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:02,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 02:09:02,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 02:09:02,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:02,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212116747] [2025-03-08 02:09:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212116747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:02,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221232114] [2025-03-08 02:09:02,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:02,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:02,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:02,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:02,940 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:05,519 INFO L93 Difference]: Finished difference Result 6765 states and 9258 transitions. [2025-03-08 02:09:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:05,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 02:09:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:05,532 INFO L225 Difference]: With dead ends: 6765 [2025-03-08 02:09:05,532 INFO L226 Difference]: Without dead ends: 4926 [2025-03-08 02:09:05,534 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:09:05,535 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 874 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:05,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 328 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 02:09:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2025-03-08 02:09:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2025-03-08 02:09:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.286417726713172) internal successors, (6270), 4874 states have internal predecessors, (6270), 0 states have call successors, (0), 0 states 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:09:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6270 transitions. [2025-03-08 02:09:05,594 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6270 transitions. Word has length 108 [2025-03-08 02:09:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:05,595 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6270 transitions. [2025-03-08 02:09:05,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6270 transitions. [2025-03-08 02:09:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 02:09:05,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:05,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:05,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:09:05,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:05,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1296877534, now seen corresponding path program 1 times [2025-03-08 02:09:05,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:05,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113847312] [2025-03-08 02:09:05,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:05,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:05,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 02:09:05,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 02:09:05,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:05,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 02:09:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113847312] [2025-03-08 02:09:05,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113847312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:05,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544281483] [2025-03-08 02:09:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:05,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:05,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:05,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:05,809 INFO L87 Difference]: Start difference. First operand 4875 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:09:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:07,243 INFO L93 Difference]: Finished difference Result 14436 states and 18541 transitions. [2025-03-08 02:09:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 179 [2025-03-08 02:09:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:07,264 INFO L225 Difference]: With dead ends: 14436 [2025-03-08 02:09:07,265 INFO L226 Difference]: Without dead ends: 8277 [2025-03-08 02:09:07,273 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:09:07,274 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:07,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-03-08 02:09:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6147. [2025-03-08 02:09:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6146 states have (on average 1.1906931337455255) internal successors, (7318), 6146 states have internal predecessors, (7318), 0 states have call successors, (0), 0 states 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:09:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7318 transitions. [2025-03-08 02:09:07,414 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7318 transitions. Word has length 179 [2025-03-08 02:09:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 6147 states and 7318 transitions. [2025-03-08 02:09:07,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:09:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7318 transitions. [2025-03-08 02:09:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 02:09:07,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:07,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:07,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:09:07,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:07,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1666481422, now seen corresponding path program 1 times [2025-03-08 02:09:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333769289] [2025-03-08 02:09:07,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:07,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 02:09:07,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 02:09:07,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:07,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:09:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:07,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333769289] [2025-03-08 02:09:07,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333769289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:07,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979886376] [2025-03-08 02:09:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:07,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:07,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:07,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:07,573 INFO L87 Difference]: Start difference. First operand 6147 states and 7318 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:09:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:08,918 INFO L93 Difference]: Finished difference Result 15692 states and 18897 transitions. [2025-03-08 02:09:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 192 [2025-03-08 02:09:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:08,937 INFO L225 Difference]: With dead ends: 15692 [2025-03-08 02:09:08,938 INFO L226 Difference]: Without dead ends: 9547 [2025-03-08 02:09:08,942 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:09:08,942 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 422 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:08,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2025-03-08 02:09:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6124. [2025-03-08 02:09:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6123 states have (on average 1.1894496162012085) internal successors, (7283), 6123 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states 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:09:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7283 transitions. [2025-03-08 02:09:09,017 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 7283 transitions. Word has length 192 [2025-03-08 02:09:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:09,019 INFO L471 AbstractCegarLoop]: Abstraction has 6124 states and 7283 transitions. [2025-03-08 02:09:09,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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:09:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 7283 transitions. [2025-03-08 02:09:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 02:09:09,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:09,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:09:09,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:09,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1120072316, now seen corresponding path program 1 times [2025-03-08 02:09:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916743182] [2025-03-08 02:09:09,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:09,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 02:09:09,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 02:09:09,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:09,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916743182] [2025-03-08 02:09:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916743182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100082650] [2025-03-08 02:09:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:09,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:09,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:09,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:09,243 INFO L87 Difference]: Start difference. First operand 6124 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:09:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:10,592 INFO L93 Difference]: Finished difference Result 16078 states and 19444 transitions. [2025-03-08 02:09:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-03-08 02:09:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:10,612 INFO L225 Difference]: With dead ends: 16078 [2025-03-08 02:09:10,612 INFO L226 Difference]: Without dead ends: 9956 [2025-03-08 02:09:10,618 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:09:10,619 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 487 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:10,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 788 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2025-03-08 02:09:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956. [2025-03-08 02:09:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9956 states, 9955 states have (on average 1.171672526368659) internal successors, (11664), 9955 states have internal predecessors, (11664), 0 states have call successors, (0), 0 states 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:09:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 11664 transitions. [2025-03-08 02:09:10,738 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 11664 transitions. Word has length 199 [2025-03-08 02:09:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:10,738 INFO L471 AbstractCegarLoop]: Abstraction has 9956 states and 11664 transitions. [2025-03-08 02:09:10,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:09:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 11664 transitions. [2025-03-08 02:09:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-08 02:09:10,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:10,741 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:10,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:09:10,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash -63307562, now seen corresponding path program 1 times [2025-03-08 02:09:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:10,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514502518] [2025-03-08 02:09:10,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-08 02:09:10,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-08 02:09:10,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:10,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 02:09:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514502518] [2025-03-08 02:09:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514502518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977288280] [2025-03-08 02:09:11,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:11,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:11,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:11,048 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:09:11,049 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:09:11,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-08 02:09:11,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-08 02:09:11,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:11,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:11,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:11,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 02:09:11,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 02:09:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977288280] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:09:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799960052] [2025-03-08 02:09:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:11,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:11,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:11,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:11,640 INFO L87 Difference]: Start difference. First operand 9956 states and 11664 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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:09:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:14,025 INFO L93 Difference]: Finished difference Result 30575 states and 36167 transitions. [2025-03-08 02:09:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 262 [2025-03-08 02:09:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:14,058 INFO L225 Difference]: With dead ends: 30575 [2025-03-08 02:09:14,059 INFO L226 Difference]: Without dead ends: 19763 [2025-03-08 02:09:14,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:14,070 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 889 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:14,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 161 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:09:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2025-03-08 02:09:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 19760. [2025-03-08 02:09:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 19759 states have (on average 1.1599777316665822) internal successors, (22920), 19759 states have internal predecessors, (22920), 0 states have call successors, (0), 0 states 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:09:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 22920 transitions. [2025-03-08 02:09:14,283 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 22920 transitions. Word has length 262 [2025-03-08 02:09:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:14,283 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 22920 transitions. [2025-03-08 02:09:14,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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:09:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 22920 transitions. [2025-03-08 02:09:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 02:09:14,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:14,287 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:14,295 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:09:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:14,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash 665540048, now seen corresponding path program 1 times [2025-03-08 02:09:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768868272] [2025-03-08 02:09:14,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 02:09:14,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 02:09:14,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:14,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:09:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768868272] [2025-03-08 02:09:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768868272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:14,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490251110] [2025-03-08 02:09:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:14,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:14,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:14,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:14,626 INFO L87 Difference]: Start difference. First operand 19760 states and 22920 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:09:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:15,973 INFO L93 Difference]: Finished difference Result 42909 states and 49989 transitions. [2025-03-08 02:09:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 275 [2025-03-08 02:09:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:16,009 INFO L225 Difference]: With dead ends: 42909 [2025-03-08 02:09:16,009 INFO L226 Difference]: Without dead ends: 22725 [2025-03-08 02:09:16,027 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:09:16,027 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 372 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:16,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 898 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22725 states. [2025-03-08 02:09:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22725 to 22725. [2025-03-08 02:09:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 22724 states have (on average 1.1364636507657102) internal successors, (25825), 22724 states have internal predecessors, (25825), 0 states have call successors, (0), 0 states 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:09:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 25825 transitions. [2025-03-08 02:09:16,544 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 25825 transitions. Word has length 275 [2025-03-08 02:09:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:16,545 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 25825 transitions. [2025-03-08 02:09:16,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:09:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 25825 transitions. [2025-03-08 02:09:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-08 02:09:16,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:16,550 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:16,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:09:16,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:16,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1387429492, now seen corresponding path program 1 times [2025-03-08 02:09:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:16,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133792075] [2025-03-08 02:09:16,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:16,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-08 02:09:16,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-08 02:09:16,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:09:16,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:16,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133792075] [2025-03-08 02:09:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133792075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:16,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057872286] [2025-03-08 02:09:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:16,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:16,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:16,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:16,730 INFO L87 Difference]: Start difference. First operand 22725 states and 25825 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:09:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:18,257 INFO L93 Difference]: Finished difference Result 56079 states and 63635 transitions. [2025-03-08 02:09:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:18,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 310 [2025-03-08 02:09:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:18,303 INFO L225 Difference]: With dead ends: 56079 [2025-03-08 02:09:18,303 INFO L226 Difference]: Without dead ends: 32923 [2025-03-08 02:09:18,323 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:09:18,324 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 431 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:18,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 418 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32923 states. [2025-03-08 02:09:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32923 to 30368. [2025-03-08 02:09:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30368 states, 30367 states have (on average 1.1221062337405736) internal successors, (34075), 30367 states have internal predecessors, (34075), 0 states have call successors, (0), 0 states 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:09:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30368 states to 30368 states and 34075 transitions. [2025-03-08 02:09:18,635 INFO L78 Accepts]: Start accepts. Automaton has 30368 states and 34075 transitions. Word has length 310 [2025-03-08 02:09:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:18,635 INFO L471 AbstractCegarLoop]: Abstraction has 30368 states and 34075 transitions. [2025-03-08 02:09:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:09:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 30368 states and 34075 transitions. [2025-03-08 02:09:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 02:09:18,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:18,641 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:18,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:09:18,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:18,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:18,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1409213982, now seen corresponding path program 1 times [2025-03-08 02:09:18,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:18,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346200144] [2025-03-08 02:09:18,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:18,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 02:09:18,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 02:09:18,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:18,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 02:09:18,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346200144] [2025-03-08 02:09:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346200144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:18,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180349832] [2025-03-08 02:09:18,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:18,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:18,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:18,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:18,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:18,894 INFO L87 Difference]: Start difference. First operand 30368 states and 34075 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:09:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:20,546 INFO L93 Difference]: Finished difference Result 70520 states and 79490 transitions. [2025-03-08 02:09:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:20,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 328 [2025-03-08 02:09:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:20,593 INFO L225 Difference]: With dead ends: 70520 [2025-03-08 02:09:20,594 INFO L226 Difference]: Without dead ends: 38877 [2025-03-08 02:09:20,616 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:09:20,617 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 342 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:20,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 776 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:09:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38877 states. [2025-03-08 02:09:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38877 to 37600. [2025-03-08 02:09:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37600 states, 37599 states have (on average 1.1063592116811618) internal successors, (41598), 37599 states have internal predecessors, (41598), 0 states have call successors, (0), 0 states 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:09:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37600 states to 37600 states and 41598 transitions. [2025-03-08 02:09:21,066 INFO L78 Accepts]: Start accepts. Automaton has 37600 states and 41598 transitions. Word has length 328 [2025-03-08 02:09:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:21,067 INFO L471 AbstractCegarLoop]: Abstraction has 37600 states and 41598 transitions. [2025-03-08 02:09:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:09:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 37600 states and 41598 transitions. [2025-03-08 02:09:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-08 02:09:21,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:21,073 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:21,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:09:21,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash 328145112, now seen corresponding path program 1 times [2025-03-08 02:09:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263652993] [2025-03-08 02:09:21,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:21,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-08 02:09:21,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-08 02:09:21,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:21,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 351 proven. 73 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 02:09:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263652993] [2025-03-08 02:09:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263652993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652560604] [2025-03-08 02:09:21,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:21,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:21,642 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:09:21,644 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:09:21,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-08 02:09:21,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-08 02:09:21,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:21,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:21,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:21,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 351 proven. 73 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 02:09:21,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 02:09:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652560604] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:09:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645781312] [2025-03-08 02:09:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:22,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:22,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:22,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:22,154 INFO L87 Difference]: Start difference. First operand 37600 states and 41598 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:09:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:24,272 INFO L93 Difference]: Finished difference Result 90535 states and 100269 transitions. [2025-03-08 02:09:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 336 [2025-03-08 02:09:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:24,341 INFO L225 Difference]: With dead ends: 90535 [2025-03-08 02:09:24,341 INFO L226 Difference]: Without dead ends: 52510 [2025-03-08 02:09:24,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:24,371 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 841 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:24,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 187 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:09:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52510 states. [2025-03-08 02:09:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52510 to 49957. [2025-03-08 02:09:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49957 states, 49956 states have (on average 1.1099167267195131) internal successors, (55447), 49956 states have internal predecessors, (55447), 0 states have call successors, (0), 0 states 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:09:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49957 states to 49957 states and 55447 transitions. [2025-03-08 02:09:24,861 INFO L78 Accepts]: Start accepts. Automaton has 49957 states and 55447 transitions. Word has length 336 [2025-03-08 02:09:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:24,862 INFO L471 AbstractCegarLoop]: Abstraction has 49957 states and 55447 transitions. [2025-03-08 02:09:24,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:09:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 49957 states and 55447 transitions. [2025-03-08 02:09:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 02:09:24,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:24,868 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:24,875 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:09:25,073 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,SelfDestructingSolverStorable10 [2025-03-08 02:09:25,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:25,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash -13592545, now seen corresponding path program 1 times [2025-03-08 02:09:25,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:25,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388413520] [2025-03-08 02:09:25,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:25,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 02:09:25,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 02:09:25,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:25,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-08 02:09:25,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388413520] [2025-03-08 02:09:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388413520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204264515] [2025-03-08 02:09:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:25,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:25,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:25,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:25,285 INFO L87 Difference]: Start difference. First operand 49957 states and 55447 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:09:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:26,936 INFO L93 Difference]: Finished difference Result 120386 states and 133258 transitions. [2025-03-08 02:09:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:26,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 434 [2025-03-08 02:09:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:27,012 INFO L225 Difference]: With dead ends: 120386 [2025-03-08 02:09:27,012 INFO L226 Difference]: Without dead ends: 70005 [2025-03-08 02:09:27,045 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:09:27,046 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 453 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 348 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:27,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70005 states. [2025-03-08 02:09:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70005 to 68689. [2025-03-08 02:09:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68689 states, 68688 states have (on average 1.1018372932681109) internal successors, (75683), 68688 states have internal predecessors, (75683), 0 states have call successors, (0), 0 states 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:09:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68689 states to 68689 states and 75683 transitions. [2025-03-08 02:09:27,758 INFO L78 Accepts]: Start accepts. Automaton has 68689 states and 75683 transitions. Word has length 434 [2025-03-08 02:09:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:27,759 INFO L471 AbstractCegarLoop]: Abstraction has 68689 states and 75683 transitions. [2025-03-08 02:09:27,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:09:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68689 states and 75683 transitions. [2025-03-08 02:09:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 02:09:27,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:27,770 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:09:27,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:09:27,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:27,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1378434843, now seen corresponding path program 1 times [2025-03-08 02:09:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:27,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424768897] [2025-03-08 02:09:27,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:27,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:27,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 02:09:27,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 02:09:27,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:27,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-08 02:09:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424768897] [2025-03-08 02:09:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424768897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:28,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417455250] [2025-03-08 02:09:28,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:28,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:28,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:28,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:28,081 INFO L87 Difference]: Start difference. First operand 68689 states and 75683 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:09:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:29,671 INFO L93 Difference]: Finished difference Result 150579 states and 166092 transitions. [2025-03-08 02:09:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 461 [2025-03-08 02:09:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:29,769 INFO L225 Difference]: With dead ends: 150579 [2025-03-08 02:09:29,770 INFO L226 Difference]: Without dead ends: 81466 [2025-03-08 02:09:29,809 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:09:29,810 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 489 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:29,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 301 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81466 states. [2025-03-08 02:09:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81466 to 62283. [2025-03-08 02:09:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62283 states, 62282 states have (on average 1.1047172537811887) internal successors, (68804), 62282 states have internal predecessors, (68804), 0 states have call successors, (0), 0 states 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:09:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62283 states to 62283 states and 68804 transitions. [2025-03-08 02:09:30,690 INFO L78 Accepts]: Start accepts. Automaton has 62283 states and 68804 transitions. Word has length 461 [2025-03-08 02:09:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:30,691 INFO L471 AbstractCegarLoop]: Abstraction has 62283 states and 68804 transitions. [2025-03-08 02:09:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:09:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 62283 states and 68804 transitions. [2025-03-08 02:09:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 02:09:30,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:30,702 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:30,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:09:30,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash -895463567, now seen corresponding path program 1 times [2025-03-08 02:09:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425719775] [2025-03-08 02:09:30,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:30,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 02:09:30,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 02:09:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425719775] [2025-03-08 02:09:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425719775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:31,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:31,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126584697] [2025-03-08 02:09:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:31,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:31,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:31,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:31,187 INFO L87 Difference]: Start difference. First operand 62283 states and 68804 transitions. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:09:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:33,168 INFO L93 Difference]: Finished difference Result 143293 states and 158065 transitions. [2025-03-08 02:09:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 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 473 [2025-03-08 02:09:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:33,266 INFO L225 Difference]: With dead ends: 143293 [2025-03-08 02:09:33,266 INFO L226 Difference]: Without dead ends: 80587 [2025-03-08 02:09:33,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:33,312 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 662 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:33,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 344 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:09:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80587 states. [2025-03-08 02:09:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80587 to 75895. [2025-03-08 02:09:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75895 states, 75894 states have (on average 1.098057817482278) internal successors, (83336), 75894 states have internal predecessors, (83336), 0 states have call successors, (0), 0 states 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:09:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75895 states to 75895 states and 83336 transitions. [2025-03-08 02:09:34,108 INFO L78 Accepts]: Start accepts. Automaton has 75895 states and 83336 transitions. Word has length 473 [2025-03-08 02:09:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:34,108 INFO L471 AbstractCegarLoop]: Abstraction has 75895 states and 83336 transitions. [2025-03-08 02:09:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:09:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 75895 states and 83336 transitions. [2025-03-08 02:09:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-08 02:09:34,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:34,116 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:34,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:09:34,117 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:34,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1277732807, now seen corresponding path program 1 times [2025-03-08 02:09:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429468224] [2025-03-08 02:09:34,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:34,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-08 02:09:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-08 02:09:34,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:09:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429468224] [2025-03-08 02:09:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429468224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:34,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:34,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292825630] [2025-03-08 02:09:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:34,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:34,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:34,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:34,249 INFO L87 Difference]: Start difference. First operand 75895 states and 83336 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:09:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:35,821 INFO L93 Difference]: Finished difference Result 158165 states and 173869 transitions. [2025-03-08 02:09:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:35,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 481 [2025-03-08 02:09:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:35,915 INFO L225 Difference]: With dead ends: 158165 [2025-03-08 02:09:35,915 INFO L226 Difference]: Without dead ends: 81846 [2025-03-08 02:09:35,958 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:09:35,958 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 475 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:35,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 255 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81846 states. [2025-03-08 02:09:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81846 to 78434. [2025-03-08 02:09:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78434 states, 78433 states have (on average 1.096706743335076) internal successors, (86018), 78433 states have internal predecessors, (86018), 0 states have call successors, (0), 0 states 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:09:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78434 states to 78434 states and 86018 transitions. [2025-03-08 02:09:36,744 INFO L78 Accepts]: Start accepts. Automaton has 78434 states and 86018 transitions. Word has length 481 [2025-03-08 02:09:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:36,744 INFO L471 AbstractCegarLoop]: Abstraction has 78434 states and 86018 transitions. [2025-03-08 02:09:36,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:09:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 78434 states and 86018 transitions. [2025-03-08 02:09:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-08 02:09:36,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:36,752 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:36,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:09:36,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:36,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash -251391696, now seen corresponding path program 1 times [2025-03-08 02:09:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682336383] [2025-03-08 02:09:36,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:36,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-08 02:09:36,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-08 02:09:36,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:36,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:09:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682336383] [2025-03-08 02:09:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682336383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726673073] [2025-03-08 02:09:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:37,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:37,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:37,463 INFO L87 Difference]: Start difference. First operand 78434 states and 86018 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:09:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:39,797 INFO L93 Difference]: Finished difference Result 188411 states and 205790 transitions. [2025-03-08 02:09:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:39,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 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 482 [2025-03-08 02:09:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:39,942 INFO L225 Difference]: With dead ends: 188411 [2025-03-08 02:09:39,942 INFO L226 Difference]: Without dead ends: 104870 [2025-03-08 02:09:39,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:39,999 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 752 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:40,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 251 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:09:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104870 states. [2025-03-08 02:09:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104870 to 99292. [2025-03-08 02:09:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99292 states, 99291 states have (on average 1.0917202969050568) internal successors, (108398), 99291 states have internal predecessors, (108398), 0 states have call successors, (0), 0 states 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:09:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99292 states to 99292 states and 108398 transitions. [2025-03-08 02:09:41,248 INFO L78 Accepts]: Start accepts. Automaton has 99292 states and 108398 transitions. Word has length 482 [2025-03-08 02:09:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:41,249 INFO L471 AbstractCegarLoop]: Abstraction has 99292 states and 108398 transitions. [2025-03-08 02:09:41,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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:09:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 99292 states and 108398 transitions. [2025-03-08 02:09:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-08 02:09:41,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:41,261 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:41,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:09:41,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:41,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash 405563199, now seen corresponding path program 1 times [2025-03-08 02:09:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:41,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030126895] [2025-03-08 02:09:41,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:41,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 02:09:41,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 02:09:41,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:41,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:41,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:41,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030126895] [2025-03-08 02:09:41,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030126895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:41,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:41,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620462259] [2025-03-08 02:09:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:41,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:41,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:41,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:41,944 INFO L87 Difference]: Start difference. First operand 99292 states and 108398 transitions. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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:09:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:44,102 INFO L93 Difference]: Finished difference Result 209650 states and 228391 transitions. [2025-03-08 02:09:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 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 486 [2025-03-08 02:09:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:44,222 INFO L225 Difference]: With dead ends: 209650 [2025-03-08 02:09:44,222 INFO L226 Difference]: Without dead ends: 109935 [2025-03-08 02:09:44,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:44,282 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 646 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:44,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 347 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:09:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109935 states. [2025-03-08 02:09:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109935 to 102267. [2025-03-08 02:09:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102267 states, 102266 states have (on average 1.0900788140731035) internal successors, (111478), 102266 states have internal predecessors, (111478), 0 states have call successors, (0), 0 states 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:09:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102267 states to 102267 states and 111478 transitions. [2025-03-08 02:09:45,275 INFO L78 Accepts]: Start accepts. Automaton has 102267 states and 111478 transitions. Word has length 486 [2025-03-08 02:09:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:45,275 INFO L471 AbstractCegarLoop]: Abstraction has 102267 states and 111478 transitions. [2025-03-08 02:09:45,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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:09:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 102267 states and 111478 transitions. [2025-03-08 02:09:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 02:09:45,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:45,285 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:45,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:09:45,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:45,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 185131691, now seen corresponding path program 1 times [2025-03-08 02:09:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:45,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718136470] [2025-03-08 02:09:45,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:45,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:45,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 02:09:45,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 02:09:45,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:45,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718136470] [2025-03-08 02:09:45,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718136470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:45,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:45,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:45,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574925418] [2025-03-08 02:09:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:45,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:45,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:45,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:45,815 INFO L87 Difference]: Start difference. First operand 102267 states and 111478 transitions. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:09:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:48,181 INFO L93 Difference]: Finished difference Result 234795 states and 255671 transitions. [2025-03-08 02:09:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:48,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 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 494 [2025-03-08 02:09:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:48,337 INFO L225 Difference]: With dead ends: 234795 [2025-03-08 02:09:48,337 INFO L226 Difference]: Without dead ends: 132530 [2025-03-08 02:09:48,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:48,403 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 646 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:48,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 169 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:09:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132530 states. [2025-03-08 02:09:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132530 to 123158. [2025-03-08 02:09:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123158 states, 123157 states have (on average 1.0899502261341214) internal successors, (134235), 123157 states have internal predecessors, (134235), 0 states have call successors, (0), 0 states 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:09:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123158 states to 123158 states and 134235 transitions. [2025-03-08 02:09:49,990 INFO L78 Accepts]: Start accepts. Automaton has 123158 states and 134235 transitions. Word has length 494 [2025-03-08 02:09:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:49,990 INFO L471 AbstractCegarLoop]: Abstraction has 123158 states and 134235 transitions. [2025-03-08 02:09:49,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:09:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 123158 states and 134235 transitions. [2025-03-08 02:09:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 02:09:50,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:50,002 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:50,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:09:50,003 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:50,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:50,003 INFO L85 PathProgramCache]: Analyzing trace with hash -695840777, now seen corresponding path program 1 times [2025-03-08 02:09:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:50,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426942439] [2025-03-08 02:09:50,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:50,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:50,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 02:09:50,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 02:09:50,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:50,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:50,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426942439] [2025-03-08 02:09:50,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426942439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:50,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472427200] [2025-03-08 02:09:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:50,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:50,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:50,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:50,797 INFO L87 Difference]: Start difference. First operand 123158 states and 134235 transitions. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:09:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:53,113 INFO L93 Difference]: Finished difference Result 268457 states and 292245 transitions. [2025-03-08 02:09:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:53,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 529 [2025-03-08 02:09:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:53,275 INFO L225 Difference]: With dead ends: 268457 [2025-03-08 02:09:53,275 INFO L226 Difference]: Without dead ends: 144876 [2025-03-08 02:09:53,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:53,352 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 873 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:53,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 266 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:09:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144876 states. [2025-03-08 02:09:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144876 to 126567. [2025-03-08 02:09:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126567 states, 126566 states have (on average 1.0891392633092616) internal successors, (137848), 126566 states have internal predecessors, (137848), 0 states have call successors, (0), 0 states 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:09:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126567 states to 126567 states and 137848 transitions. [2025-03-08 02:09:55,113 INFO L78 Accepts]: Start accepts. Automaton has 126567 states and 137848 transitions. Word has length 529 [2025-03-08 02:09:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:55,113 INFO L471 AbstractCegarLoop]: Abstraction has 126567 states and 137848 transitions. [2025-03-08 02:09:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:09:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 126567 states and 137848 transitions. [2025-03-08 02:09:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 02:09:55,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:55,121 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:55,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:09:55,121 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -164981917, now seen corresponding path program 1 times [2025-03-08 02:09:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336339007] [2025-03-08 02:09:55,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:55,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 02:09:55,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 02:09:55,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:09:55,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:55,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336339007] [2025-03-08 02:09:55,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336339007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:55,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782020763] [2025-03-08 02:09:55,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:55,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:55,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:55,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:55,554 INFO L87 Difference]: Start difference. First operand 126567 states and 137848 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:09:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:57,183 INFO L93 Difference]: Finished difference Result 266319 states and 289317 transitions. [2025-03-08 02:09:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 537 [2025-03-08 02:09:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:57,364 INFO L225 Difference]: With dead ends: 266319 [2025-03-08 02:09:57,365 INFO L226 Difference]: Without dead ends: 139328 [2025-03-08 02:09:57,441 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:09:57,442 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 437 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:57,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 358 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139328 states. [2025-03-08 02:09:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139328 to 124439. [2025-03-08 02:09:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124439 states, 124438 states have (on average 1.0876902553882255) internal successors, (135350), 124438 states have internal predecessors, (135350), 0 states have call successors, (0), 0 states 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:09:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124439 states to 124439 states and 135350 transitions. [2025-03-08 02:09:59,090 INFO L78 Accepts]: Start accepts. Automaton has 124439 states and 135350 transitions. Word has length 537 [2025-03-08 02:09:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:59,090 INFO L471 AbstractCegarLoop]: Abstraction has 124439 states and 135350 transitions. [2025-03-08 02:09:59,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states 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:09:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 124439 states and 135350 transitions. [2025-03-08 02:09:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-08 02:09:59,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:59,098 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:59,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:09:59,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:59,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash -126810660, now seen corresponding path program 1 times [2025-03-08 02:09:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646506321] [2025-03-08 02:09:59,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:59,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-08 02:09:59,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-08 02:09:59,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:09:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646506321] [2025-03-08 02:09:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646506321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:59,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499088872] [2025-03-08 02:09:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:59,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:59,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:59,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:59,621 INFO L87 Difference]: Start difference. First operand 124439 states and 135350 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:10:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:01,158 INFO L93 Difference]: Finished difference Result 248874 states and 270696 transitions. [2025-03-08 02:10:01,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:01,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 542 [2025-03-08 02:10:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:01,318 INFO L225 Difference]: With dead ends: 248874 [2025-03-08 02:10:01,318 INFO L226 Difference]: Without dead ends: 124436 [2025-03-08 02:10:01,396 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:10:01,396 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 590 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:01,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 555 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:10:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124436 states. [2025-03-08 02:10:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124436 to 124435. [2025-03-08 02:10:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124435 states, 124434 states have (on average 1.0872992911905106) internal successors, (135297), 124434 states have internal predecessors, (135297), 0 states have call successors, (0), 0 states 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:10:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124435 states to 124435 states and 135297 transitions. [2025-03-08 02:10:03,103 INFO L78 Accepts]: Start accepts. Automaton has 124435 states and 135297 transitions. Word has length 542 [2025-03-08 02:10:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:03,103 INFO L471 AbstractCegarLoop]: Abstraction has 124435 states and 135297 transitions. [2025-03-08 02:10:03,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:10:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 124435 states and 135297 transitions. [2025-03-08 02:10:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-08 02:10:03,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:03,112 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:10:03,112 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:03,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash 802163674, now seen corresponding path program 1 times [2025-03-08 02:10:03,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:03,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108204387] [2025-03-08 02:10:03,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:03,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-08 02:10:03,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-08 02:10:03,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:03,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-08 02:10:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108204387] [2025-03-08 02:10:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108204387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:03,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:10:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564269688] [2025-03-08 02:10:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:03,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:10:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:03,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:10:03,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:10:03,507 INFO L87 Difference]: Start difference. First operand 124435 states and 135297 transitions. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:10:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:06,666 INFO L93 Difference]: Finished difference Result 308476 states and 335478 transitions. [2025-03-08 02:10:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:10:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 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 553 [2025-03-08 02:10:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:06,897 INFO L225 Difference]: With dead ends: 308476 [2025-03-08 02:10:06,897 INFO L226 Difference]: Without dead ends: 181068 [2025-03-08 02:10:06,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:10:06,976 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1317 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:06,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 224 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:10:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181068 states. [2025-03-08 02:10:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181068 to 163620. [2025-03-08 02:10:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163620 states, 163619 states have (on average 1.0788172522751025) internal successors, (176515), 163619 states have internal predecessors, (176515), 0 states have call successors, (0), 0 states 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:10:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163620 states to 163620 states and 176515 transitions. [2025-03-08 02:10:09,037 INFO L78 Accepts]: Start accepts. Automaton has 163620 states and 176515 transitions. Word has length 553 [2025-03-08 02:10:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:09,038 INFO L471 AbstractCegarLoop]: Abstraction has 163620 states and 176515 transitions. [2025-03-08 02:10:09,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:10:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 163620 states and 176515 transitions. [2025-03-08 02:10:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-08 02:10:09,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:09,049 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:09,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:10:09,049 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:09,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2106691812, now seen corresponding path program 1 times [2025-03-08 02:10:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747021086] [2025-03-08 02:10:09,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:09,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:09,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-08 02:10:09,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-08 02:10:09,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:09,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-08 02:10:09,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747021086] [2025-03-08 02:10:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747021086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:09,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645653914] [2025-03-08 02:10:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:09,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:09,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:09,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:09,494 INFO L87 Difference]: Start difference. First operand 163620 states and 176515 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:10:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:10,761 INFO L93 Difference]: Finished difference Result 321265 states and 346515 transitions. [2025-03-08 02:10:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:10,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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 570 [2025-03-08 02:10:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:10,937 INFO L225 Difference]: With dead ends: 321265 [2025-03-08 02:10:10,937 INFO L226 Difference]: Without dead ends: 157647 [2025-03-08 02:10:10,996 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:10:10,996 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 630 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:10,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 103 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:10:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157647 states. [2025-03-08 02:10:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157647 to 153379. [2025-03-08 02:10:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153379 states, 153378 states have (on average 1.0792877726923027) internal successors, (165539), 153378 states have internal predecessors, (165539), 0 states have call successors, (0), 0 states 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:10:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153379 states to 153379 states and 165539 transitions. [2025-03-08 02:10:12,866 INFO L78 Accepts]: Start accepts. Automaton has 153379 states and 165539 transitions. Word has length 570 [2025-03-08 02:10:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:12,866 INFO L471 AbstractCegarLoop]: Abstraction has 153379 states and 165539 transitions. [2025-03-08 02:10:12,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:10:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 153379 states and 165539 transitions. [2025-03-08 02:10:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-08 02:10:12,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:12,879 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:12,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:10:12,879 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1491392272, now seen corresponding path program 1 times [2025-03-08 02:10:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198469008] [2025-03-08 02:10:12,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:12,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-08 02:10:12,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-08 02:10:12,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:12,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 483 proven. 36 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 02:10:13,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198469008] [2025-03-08 02:10:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198469008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372567237] [2025-03-08 02:10:13,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:13,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:13,848 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:10:13,850 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:10:13,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-08 02:10:13,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-08 02:10:13,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:13,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:13,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:10:13,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:10:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 529 proven. 82 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-08 02:10:14,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:10:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 529 proven. 82 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-08 02:10:15,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372567237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:10:15,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:10:15,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:10:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119852297] [2025-03-08 02:10:15,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:10:15,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:10:15,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:15,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:10:15,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:10:15,425 INFO L87 Difference]: Start difference. First operand 153379 states and 165539 transitions. Second operand has 9 states, 9 states have (on average 122.77777777777777) internal successors, (1105), 9 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)