./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem12_label04.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 33de5d7f20015c0808aeb1de8a96a544518a9ee4634466bd76c0c961f4a657cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:34:24,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:34:24,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:34:24,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:34:24,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:34:24,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:34:24,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:34:24,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:34:24,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:34:24,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:34:24,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:34:24,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:34:24,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:34:24,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:34:24,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:34:24,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:34:24,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:34:24,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:34:24,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:24,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:34:24,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:34:24,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:34:24,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:34:24,895 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 -> 33de5d7f20015c0808aeb1de8a96a544518a9ee4634466bd76c0c961f4a657cf [2025-03-03 10:34:25,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:34:25,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:34:25,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:34:25,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:34:25,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:34:25,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label04.c [2025-03-03 10:34:26,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63197513b/d81b2824cd1b4d288bd1a51c4f22ee2a/FLAG48f77145e [2025-03-03 10:34:26,767 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:34:26,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label04.c [2025-03-03 10:34:26,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63197513b/d81b2824cd1b4d288bd1a51c4f22ee2a/FLAG48f77145e [2025-03-03 10:34:26,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63197513b/d81b2824cd1b4d288bd1a51c4f22ee2a [2025-03-03 10:34:26,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:34:26,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:34:26,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:26,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:34:26,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:34:26,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:26" (1/1) ... [2025-03-03 10:34:26,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340a5419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:26, skipping insertion in model container [2025-03-03 10:34:26,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:26" (1/1) ... [2025-03-03 10:34:26,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:34:27,142 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/Problem12_label04.c[7422,7435] [2025-03-03 10:34:27,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:27,613 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:34:27,639 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/Problem12_label04.c[7422,7435] [2025-03-03 10:34:27,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:27,915 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:34:27,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27 WrapperNode [2025-03-03 10:34:27,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:27,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:27,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:34:27,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:34:27,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:27,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,211 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:34:28,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:28,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:34:28,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:34:28,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:34:28,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,385 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-03 10:34:28,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:34:28,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:34:28,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:34:28,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:34:28,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (1/1) ... [2025-03-03 10:34:28,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:28,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:28,603 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-03 10:34:28,607 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-03 10:34:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:34:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:34:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:34:28,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:34:28,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:34:28,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:34:32,014 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:34:32,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:34:32,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:34:32,132 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:34:32,133 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:34:32,150 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:34:32,150 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:34:32,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:32 BoogieIcfgContainer [2025-03-03 10:34:32,151 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:34:32,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:34:32,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:34:32,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:34:32,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:34:26" (1/3) ... [2025-03-03 10:34:32,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277b6e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:32, skipping insertion in model container [2025-03-03 10:34:32,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:27" (2/3) ... [2025-03-03 10:34:32,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277b6e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:32, skipping insertion in model container [2025-03-03 10:34:32,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:32" (3/3) ... [2025-03-03 10:34:32,161 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label04.c [2025-03-03 10:34:32,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:34:32,174 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label04.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:34:32,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:34:32,258 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;@2f8dfe50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:34:32,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:34:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 10:34:32,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:32,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:32,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1259654253, now seen corresponding path program 1 times [2025-03-03 10:34:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885141360] [2025-03-03 10:34:32,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:32,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 10:34:32,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 10:34:32,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:32,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:32,605 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-03 10:34:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885141360] [2025-03-03 10:34:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885141360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:32,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128948880] [2025-03-03 10:34:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:32,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:32,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:32,628 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:35,574 INFO L93 Difference]: Finished difference Result 2404 states and 4642 transitions. [2025-03-03 10:34:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:35,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 10:34:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:35,592 INFO L225 Difference]: With dead ends: 2404 [2025-03-03 10:34:35,592 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:34:35,596 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-03 10:34:35,598 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 760 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:35,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:34:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:34:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:34:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions. [2025-03-03 10:34:35,682 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 60 [2025-03-03 10:34:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:35,683 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions. [2025-03-03 10:34:35,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions. [2025-03-03 10:34:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 10:34:35,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:35,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:34:35,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:34:35,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 555873319, now seen corresponding path program 1 times [2025-03-03 10:34:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856980758] [2025-03-03 10:34:35,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 10:34:35,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 10:34:35,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:35,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:35,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856980758] [2025-03-03 10:34:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856980758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:35,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397173204] [2025-03-03 10:34:35,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:35,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:35,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:35,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:35,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:35,931 INFO L87 Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:38,523 INFO L93 Difference]: Finished difference Result 4514 states and 7250 transitions. [2025-03-03 10:34:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:38,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-03 10:34:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:38,533 INFO L225 Difference]: With dead ends: 4514 [2025-03-03 10:34:38,533 INFO L226 Difference]: Without dead ends: 3010 [2025-03-03 10:34:38,535 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-03 10:34:38,536 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:38,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 583 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:34:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-03-03 10:34:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-03-03 10:34:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4595942800133024) internal successors, (4389), 3007 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4389 transitions. [2025-03-03 10:34:38,582 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4389 transitions. Word has length 135 [2025-03-03 10:34:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:38,583 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4389 transitions. [2025-03-03 10:34:38,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4389 transitions. [2025-03-03 10:34:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 10:34:38,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:38,587 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:34:38,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:34:38,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:38,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash -727370519, now seen corresponding path program 1 times [2025-03-03 10:34:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:38,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258991849] [2025-03-03 10:34:38,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:38,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:38,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 10:34:38,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 10:34:38,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:38,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:38,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258991849] [2025-03-03 10:34:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258991849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:38,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:38,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381676205] [2025-03-03 10:34:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:38,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:38,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:38,765 INFO L87 Difference]: Start difference. First operand 3008 states and 4389 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:40,821 INFO L93 Difference]: Finished difference Result 9018 states and 13162 transitions. [2025-03-03 10:34:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 10:34:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:40,838 INFO L225 Difference]: With dead ends: 9018 [2025-03-03 10:34:40,838 INFO L226 Difference]: Without dead ends: 6012 [2025-03-03 10:34:40,842 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-03 10:34:40,842 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:40,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:34:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-03 10:34:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012. [2025-03-03 10:34:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.2951256030610547) internal successors, (7785), 6011 states have internal predecessors, (7785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7785 transitions. [2025-03-03 10:34:40,942 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7785 transitions. Word has length 164 [2025-03-03 10:34:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:40,943 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7785 transitions. [2025-03-03 10:34:40,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7785 transitions. [2025-03-03 10:34:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 10:34:40,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:40,947 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:34:40,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:34:40,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1058896322, now seen corresponding path program 1 times [2025-03-03 10:34:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47843406] [2025-03-03 10:34:40,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:40,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 10:34:40,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 10:34:40,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:40,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 10:34:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47843406] [2025-03-03 10:34:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47843406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502041439] [2025-03-03 10:34:41,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:41,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:41,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:41,300 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-03 10:34:41,302 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-03 10:34:41,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 10:34:41,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 10:34:41,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:41,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:41,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:34:41,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 10:34:41,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502041439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:34:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235964276] [2025-03-03 10:34:41,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:41,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:41,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:41,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:41,655 INFO L87 Difference]: Start difference. First operand 6012 states and 7785 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:43,661 INFO L93 Difference]: Finished difference Result 15026 states and 18964 transitions. [2025-03-03 10:34:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:43,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 201 [2025-03-03 10:34:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:43,696 INFO L225 Difference]: With dead ends: 15026 [2025-03-03 10:34:43,696 INFO L226 Difference]: Without dead ends: 9016 [2025-03-03 10:34:43,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:43,706 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:43,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 230 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:34:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9016 states. [2025-03-03 10:34:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9016 to 8265. [2025-03-03 10:34:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 8264 states have (on average 1.2282187802516942) internal successors, (10150), 8264 states have internal predecessors, (10150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 10150 transitions. [2025-03-03 10:34:43,810 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 10150 transitions. Word has length 201 [2025-03-03 10:34:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:43,811 INFO L471 AbstractCegarLoop]: Abstraction has 8265 states and 10150 transitions. [2025-03-03 10:34:43,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 10150 transitions. [2025-03-03 10:34:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 10:34:43,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:43,814 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:43,821 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-03 10:34:44,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:44,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1441840316, now seen corresponding path program 1 times [2025-03-03 10:34:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106026176] [2025-03-03 10:34:44,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:44,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 10:34:44,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 10:34:44,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:44,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:34:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106026176] [2025-03-03 10:34:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106026176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041040095] [2025-03-03 10:34:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:44,326 INFO L87 Difference]: Start difference. First operand 8265 states and 10150 transitions. Second operand has 4 states, 4 states have (on average 50.75) 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-03 10:34:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:46,750 INFO L93 Difference]: Finished difference Result 16604 states and 20373 transitions. [2025-03-03 10:34:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) 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 272 [2025-03-03 10:34:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:46,768 INFO L225 Difference]: With dead ends: 16604 [2025-03-03 10:34:46,769 INFO L226 Difference]: Without dead ends: 8267 [2025-03-03 10:34:46,773 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-03 10:34:46,774 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 775 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:46,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 366 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:34:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2025-03-03 10:34:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 8265. [2025-03-03 10:34:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 8264 states have (on average 1.1977250726040658) internal successors, (9898), 8264 states have internal predecessors, (9898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 9898 transitions. [2025-03-03 10:34:46,882 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 9898 transitions. Word has length 272 [2025-03-03 10:34:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:46,884 INFO L471 AbstractCegarLoop]: Abstraction has 8265 states and 9898 transitions. [2025-03-03 10:34:46,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) 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-03 10:34:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 9898 transitions. [2025-03-03 10:34:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 10:34:46,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:46,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:34:46,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:34:46,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:46,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash -924469282, now seen corresponding path program 1 times [2025-03-03 10:34:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:46,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047083913] [2025-03-03 10:34:46,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:46,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:46,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 10:34:46,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 10:34:46,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:46,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 10:34:47,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047083913] [2025-03-03 10:34:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047083913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:47,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:47,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581522948] [2025-03-03 10:34:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:47,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:34:47,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:34:47,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:47,368 INFO L87 Difference]: Start difference. First operand 8265 states and 9898 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:51,048 INFO L93 Difference]: Finished difference Result 21785 states and 25452 transitions. [2025-03-03 10:34:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:34:51,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 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 273 [2025-03-03 10:34:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:51,066 INFO L225 Difference]: With dead ends: 21785 [2025-03-03 10:34:51,066 INFO L226 Difference]: Without dead ends: 13522 [2025-03-03 10:34:51,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:34:51,071 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 2734 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5950 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 6096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 5950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:51,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 638 Invalid, 6096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 5950 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 10:34:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13522 states. [2025-03-03 10:34:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13522 to 12020. [2025-03-03 10:34:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.151676512189034) internal successors, (13842), 12019 states have internal predecessors, (13842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 13842 transitions. [2025-03-03 10:34:51,190 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 13842 transitions. Word has length 273 [2025-03-03 10:34:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:51,191 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 13842 transitions. [2025-03-03 10:34:51,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 13842 transitions. [2025-03-03 10:34:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-03 10:34:51,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:51,199 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, 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, 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] [2025-03-03 10:34:51,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:34:51,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:51,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1730643018, now seen corresponding path program 1 times [2025-03-03 10:34:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294278917] [2025-03-03 10:34:51,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:51,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-03 10:34:51,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-03 10:34:51,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:51,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 10:34:51,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294278917] [2025-03-03 10:34:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294278917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:51,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:51,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443670132] [2025-03-03 10:34:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:51,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:51,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:51,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:51,378 INFO L87 Difference]: Start difference. First operand 12020 states and 13842 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:53,816 INFO L93 Difference]: Finished difference Result 36054 states and 41521 transitions. [2025-03-03 10:34:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 355 [2025-03-03 10:34:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:53,845 INFO L225 Difference]: With dead ends: 36054 [2025-03-03 10:34:53,845 INFO L226 Difference]: Without dead ends: 24036 [2025-03-03 10:34:53,854 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-03 10:34:53,855 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:53,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1385 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:34:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2025-03-03 10:34:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 22534. [2025-03-03 10:34:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.1372653441618958) internal successors, (25626), 22533 states have internal predecessors, (25626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 25626 transitions. [2025-03-03 10:34:54,068 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 25626 transitions. Word has length 355 [2025-03-03 10:34:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:54,068 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 25626 transitions. [2025-03-03 10:34:54,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 25626 transitions. [2025-03-03 10:34:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-03 10:34:54,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:54,073 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, 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, 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] [2025-03-03 10:34:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:34:54,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1345707328, now seen corresponding path program 1 times [2025-03-03 10:34:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057940427] [2025-03-03 10:34:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:54,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-03 10:34:54,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-03 10:34:54,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:54,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:34:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057940427] [2025-03-03 10:34:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057940427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278057044] [2025-03-03 10:34:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:54,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:54,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:54,560 INFO L87 Difference]: Start difference. First operand 22534 states and 25626 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:56,857 INFO L93 Difference]: Finished difference Result 54078 states and 62348 transitions. [2025-03-03 10:34:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:56,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 359 [2025-03-03 10:34:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:56,901 INFO L225 Difference]: With dead ends: 54078 [2025-03-03 10:34:56,901 INFO L226 Difference]: Without dead ends: 31546 [2025-03-03 10:34:56,919 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-03 10:34:56,920 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 703 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:56,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 506 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:34:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31546 states. [2025-03-03 10:34:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31546 to 31546. [2025-03-03 10:34:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31546 states, 31545 states have (on average 1.1370106197495642) internal successors, (35867), 31545 states have internal predecessors, (35867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31546 states to 31546 states and 35867 transitions. [2025-03-03 10:34:57,252 INFO L78 Accepts]: Start accepts. Automaton has 31546 states and 35867 transitions. Word has length 359 [2025-03-03 10:34:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:57,252 INFO L471 AbstractCegarLoop]: Abstraction has 31546 states and 35867 transitions. [2025-03-03 10:34:57,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:34:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 31546 states and 35867 transitions. [2025-03-03 10:34:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-03 10:34:57,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:57,258 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:34:57,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:34:57,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:57,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1353293882, now seen corresponding path program 1 times [2025-03-03 10:34:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480710750] [2025-03-03 10:34:57,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:57,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-03 10:34:57,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-03 10:34:57,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:57,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 173 proven. 108 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-03 10:34:57,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480710750] [2025-03-03 10:34:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480710750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:34:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133726966] [2025-03-03 10:34:57,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:57,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:34:57,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:57,756 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-03 10:34:57,757 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-03 10:34:57,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-03 10:34:57,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-03 10:34:57,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:57,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:57,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:34:57,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:34:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 10:34:58,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:34:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133726966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:34:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 10:34:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124096798] [2025-03-03 10:34:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:58,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:58,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:58,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:58,033 INFO L87 Difference]: Start difference. First operand 31546 states and 35867 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:00,144 INFO L93 Difference]: Finished difference Result 75106 states and 86624 transitions. [2025-03-03 10:35:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:00,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 387 [2025-03-03 10:35:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:00,195 INFO L225 Difference]: With dead ends: 75106 [2025-03-03 10:35:00,195 INFO L226 Difference]: Without dead ends: 43562 [2025-03-03 10:35:00,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:00,215 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 789 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:00,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 235 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43562 states. [2025-03-03 10:35:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43562 to 43562. [2025-03-03 10:35:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43562 states, 43561 states have (on average 1.1325727141250201) internal successors, (49336), 43561 states have internal predecessors, (49336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43562 states to 43562 states and 49336 transitions. [2025-03-03 10:35:00,601 INFO L78 Accepts]: Start accepts. Automaton has 43562 states and 49336 transitions. Word has length 387 [2025-03-03 10:35:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:00,602 INFO L471 AbstractCegarLoop]: Abstraction has 43562 states and 49336 transitions. [2025-03-03 10:35:00,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 43562 states and 49336 transitions. [2025-03-03 10:35:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-03 10:35:00,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:00,606 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:35:00,612 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-03 10:35:00,810 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,SelfDestructingSolverStorable8 [2025-03-03 10:35:00,810 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:00,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash -274662512, now seen corresponding path program 1 times [2025-03-03 10:35:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164125526] [2025-03-03 10:35:00,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:00,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:35:00,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:35:00,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:00,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:35:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164125526] [2025-03-03 10:35:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164125526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:01,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:01,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:01,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44203796] [2025-03-03 10:35:01,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:01,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:01,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:01,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:01,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:01,152 INFO L87 Difference]: Start difference. First operand 43562 states and 49336 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:03,579 INFO L93 Difference]: Finished difference Result 124672 states and 141790 transitions. [2025-03-03 10:35:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 391 [2025-03-03 10:35:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:03,651 INFO L225 Difference]: With dead ends: 124672 [2025-03-03 10:35:03,651 INFO L226 Difference]: Without dead ends: 76606 [2025-03-03 10:35:03,678 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-03 10:35:03,679 INFO L435 NwaCegarLoop]: 1286 mSDtfsCounter, 733 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2209 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:03,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1294 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2209 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:35:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76606 states. [2025-03-03 10:35:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76606 to 72100. [2025-03-03 10:35:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72100 states, 72099 states have (on average 1.1029279185564294) internal successors, (79520), 72099 states have internal predecessors, (79520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72100 states to 72100 states and 79520 transitions. [2025-03-03 10:35:04,268 INFO L78 Accepts]: Start accepts. Automaton has 72100 states and 79520 transitions. Word has length 391 [2025-03-03 10:35:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:04,269 INFO L471 AbstractCegarLoop]: Abstraction has 72100 states and 79520 transitions. [2025-03-03 10:35:04,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 72100 states and 79520 transitions. [2025-03-03 10:35:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-03 10:35:04,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:04,274 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:35:04,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:35:04,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:04,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1404772268, now seen corresponding path program 1 times [2025-03-03 10:35:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675816738] [2025-03-03 10:35:04,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:04,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-03 10:35:04,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-03 10:35:04,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:04,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:35:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675816738] [2025-03-03 10:35:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675816738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421266635] [2025-03-03 10:35:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:04,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:04,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:04,549 INFO L87 Difference]: Start difference. First operand 72100 states and 79520 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:07,026 INFO L93 Difference]: Finished difference Result 170483 states and 190051 transitions. [2025-03-03 10:35:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:07,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 415 [2025-03-03 10:35:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:07,137 INFO L225 Difference]: With dead ends: 170483 [2025-03-03 10:35:07,137 INFO L226 Difference]: Without dead ends: 98385 [2025-03-03 10:35:07,155 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-03 10:35:07,156 INFO L435 NwaCegarLoop]: 1242 mSDtfsCounter, 728 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:07,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1249 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2125 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98385 states. [2025-03-03 10:35:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98385 to 94630. [2025-03-03 10:35:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94630 states, 94629 states have (on average 1.0939986684842913) internal successors, (103524), 94629 states have internal predecessors, (103524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94630 states to 94630 states and 103524 transitions. [2025-03-03 10:35:08,084 INFO L78 Accepts]: Start accepts. Automaton has 94630 states and 103524 transitions. Word has length 415 [2025-03-03 10:35:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:08,084 INFO L471 AbstractCegarLoop]: Abstraction has 94630 states and 103524 transitions. [2025-03-03 10:35:08,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 94630 states and 103524 transitions. [2025-03-03 10:35:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-03-03 10:35:08,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:08,091 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, 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, 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] [2025-03-03 10:35:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:35:08,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1999832010, now seen corresponding path program 1 times [2025-03-03 10:35:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267036177] [2025-03-03 10:35:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:08,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-03 10:35:08,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-03 10:35:08,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:08,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-03 10:35:08,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:08,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267036177] [2025-03-03 10:35:08,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267036177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:08,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:08,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131787832] [2025-03-03 10:35:08,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:08,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:08,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:08,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:08,484 INFO L87 Difference]: Start difference. First operand 94630 states and 103524 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:10,936 INFO L93 Difference]: Finished difference Result 225306 states and 247487 transitions. [2025-03-03 10:35:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 419 [2025-03-03 10:35:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:11,082 INFO L225 Difference]: With dead ends: 225306 [2025-03-03 10:35:11,082 INFO L226 Difference]: Without dead ends: 130678 [2025-03-03 10:35:11,134 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-03 10:35:11,134 INFO L435 NwaCegarLoop]: 1202 mSDtfsCounter, 715 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:11,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1210 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130678 states. [2025-03-03 10:35:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130678 to 125421. [2025-03-03 10:35:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125421 states, 125420 states have (on average 1.0940041460692074) internal successors, (137210), 125420 states have internal predecessors, (137210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 137210 transitions. [2025-03-03 10:35:12,403 INFO L78 Accepts]: Start accepts. Automaton has 125421 states and 137210 transitions. Word has length 419 [2025-03-03 10:35:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:12,404 INFO L471 AbstractCegarLoop]: Abstraction has 125421 states and 137210 transitions. [2025-03-03 10:35:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 125421 states and 137210 transitions. [2025-03-03 10:35:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-03 10:35:12,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:12,412 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:35:12,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:35:12,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:12,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash 140269578, now seen corresponding path program 1 times [2025-03-03 10:35:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838095198] [2025-03-03 10:35:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:12,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-03 10:35:12,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-03 10:35:12,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:12,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-03 10:35:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838095198] [2025-03-03 10:35:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838095198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129636390] [2025-03-03 10:35:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:12,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:12,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:12,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:12,803 INFO L87 Difference]: Start difference. First operand 125421 states and 137210 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:15,403 INFO L93 Difference]: Finished difference Result 259101 states and 282862 transitions. [2025-03-03 10:35:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 487 [2025-03-03 10:35:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:15,554 INFO L225 Difference]: With dead ends: 259101 [2025-03-03 10:35:15,554 INFO L226 Difference]: Without dead ends: 133682 [2025-03-03 10:35:15,613 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-03 10:35:15,614 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:15,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 401 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133682 states. [2025-03-03 10:35:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133682 to 125421. [2025-03-03 10:35:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125421 states, 125420 states have (on average 1.082435018338383) internal successors, (135759), 125420 states have internal predecessors, (135759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 135759 transitions. [2025-03-03 10:35:16,951 INFO L78 Accepts]: Start accepts. Automaton has 125421 states and 135759 transitions. Word has length 487 [2025-03-03 10:35:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:16,952 INFO L471 AbstractCegarLoop]: Abstraction has 125421 states and 135759 transitions. [2025-03-03 10:35:16,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 125421 states and 135759 transitions. [2025-03-03 10:35:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-03 10:35:16,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:16,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:16,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:35:16,960 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1645309583, now seen corresponding path program 1 times [2025-03-03 10:35:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:16,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267491460] [2025-03-03 10:35:16,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:16,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-03 10:35:16,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-03 10:35:16,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:16,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 10:35:17,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:17,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267491460] [2025-03-03 10:35:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267491460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313947916] [2025-03-03 10:35:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:17,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:17,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:17,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:17,086 INFO L87 Difference]: Start difference. First operand 125421 states and 135759 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:19,947 INFO L93 Difference]: Finished difference Result 287639 states and 312378 transitions. [2025-03-03 10:35:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2025-03-03 10:35:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:20,124 INFO L225 Difference]: With dead ends: 287639 [2025-03-03 10:35:20,124 INFO L226 Difference]: Without dead ends: 162220 [2025-03-03 10:35:20,185 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-03 10:35:20,185 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 664 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:20,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1278 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:35:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162220 states. [2025-03-03 10:35:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162220 to 156963. [2025-03-03 10:35:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156963 states, 156962 states have (on average 1.0750181572609931) internal successors, (168737), 156962 states have internal predecessors, (168737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156963 states to 156963 states and 168737 transitions. [2025-03-03 10:35:21,714 INFO L78 Accepts]: Start accepts. Automaton has 156963 states and 168737 transitions. Word has length 497 [2025-03-03 10:35:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:21,715 INFO L471 AbstractCegarLoop]: Abstraction has 156963 states and 168737 transitions. [2025-03-03 10:35:21,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 156963 states and 168737 transitions. [2025-03-03 10:35:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-03-03 10:35:21,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:21,724 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:21,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:35:21,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:21,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -239714656, now seen corresponding path program 1 times [2025-03-03 10:35:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140390376] [2025-03-03 10:35:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:21,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-03-03 10:35:22,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-03-03 10:35:22,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-03 10:35:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140390376] [2025-03-03 10:35:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140390376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868342216] [2025-03-03 10:35:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:22,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:22,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:22,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:22,292 INFO L87 Difference]: Start difference. First operand 156963 states and 168737 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:24,911 INFO L93 Difference]: Finished difference Result 342462 states and 370221 transitions. [2025-03-03 10:35:24,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:24,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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 558 [2025-03-03 10:35:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:25,151 INFO L225 Difference]: With dead ends: 342462 [2025-03-03 10:35:25,151 INFO L226 Difference]: Without dead ends: 185501 [2025-03-03 10:35:25,241 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-03 10:35:25,242 INFO L435 NwaCegarLoop]: 1276 mSDtfsCounter, 604 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:25,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1284 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:35:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185501 states. [2025-03-03 10:35:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185501 to 182497. [2025-03-03 10:35:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182497 states, 182496 states have (on average 1.0699412589864983) internal successors, (195260), 182496 states have internal predecessors, (195260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182497 states to 182497 states and 195260 transitions. [2025-03-03 10:35:27,233 INFO L78 Accepts]: Start accepts. Automaton has 182497 states and 195260 transitions. Word has length 558 [2025-03-03 10:35:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:27,233 INFO L471 AbstractCegarLoop]: Abstraction has 182497 states and 195260 transitions. [2025-03-03 10:35:27,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 182497 states and 195260 transitions. [2025-03-03 10:35:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-03 10:35:27,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:27,241 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:27,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:35:27,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:27,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1540605339, now seen corresponding path program 1 times [2025-03-03 10:35:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279422800] [2025-03-03 10:35:27,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:27,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-03 10:35:27,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-03 10:35:27,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:27,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-03 10:35:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279422800] [2025-03-03 10:35:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279422800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:27,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:27,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:35:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195877622] [2025-03-03 10:35:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:27,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:35:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:27,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:35:27,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:35:27,922 INFO L87 Difference]: Start difference. First operand 182497 states and 195260 transitions. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:31,104 INFO L93 Difference]: Finished difference Result 365420 states and 390946 transitions. [2025-03-03 10:35:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:35:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 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 565 [2025-03-03 10:35:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:31,289 INFO L225 Difference]: With dead ends: 365420 [2025-03-03 10:35:31,290 INFO L226 Difference]: Without dead ends: 182497 [2025-03-03 10:35:31,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:35:31,382 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5519 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 5638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 5519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:31,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1449 Invalid, 5638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 5519 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:35:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182497 states. [2025-03-03 10:35:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182497 to 181746. [2025-03-03 10:35:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181746 states, 181745 states have (on average 1.0588681944482654) internal successors, (192444), 181745 states have internal predecessors, (192444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181746 states to 181746 states and 192444 transitions. [2025-03-03 10:35:33,431 INFO L78 Accepts]: Start accepts. Automaton has 181746 states and 192444 transitions. Word has length 565 [2025-03-03 10:35:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 181746 states and 192444 transitions. [2025-03-03 10:35:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 181746 states and 192444 transitions. [2025-03-03 10:35:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-03 10:35:33,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:33,440 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:33,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:35:33,440 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:33,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash -692161639, now seen corresponding path program 1 times [2025-03-03 10:35:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579789865] [2025-03-03 10:35:33,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:33,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-03 10:35:33,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-03 10:35:33,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-03-03 10:35:33,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:33,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579789865] [2025-03-03 10:35:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579789865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:33,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:33,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:33,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068747847] [2025-03-03 10:35:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:33,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:33,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:33,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:33,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:33,597 INFO L87 Difference]: Start difference. First operand 181746 states and 192444 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:36,160 INFO L93 Difference]: Finished difference Result 383767 states and 406424 transitions. [2025-03-03 10:35:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:36,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 576 [2025-03-03 10:35:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:36,424 INFO L225 Difference]: With dead ends: 383767 [2025-03-03 10:35:36,424 INFO L226 Difference]: Without dead ends: 202023 [2025-03-03 10:35:36,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:36,527 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 814 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:36,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1019 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:35:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202023 states. [2025-03-03 10:35:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202023 to 201272. [2025-03-03 10:35:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201272 states, 201271 states have (on average 1.0555966830790326) internal successors, (212461), 201271 states have internal predecessors, (212461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201272 states to 201272 states and 212461 transitions. [2025-03-03 10:35:38,536 INFO L78 Accepts]: Start accepts. Automaton has 201272 states and 212461 transitions. Word has length 576 [2025-03-03 10:35:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:38,537 INFO L471 AbstractCegarLoop]: Abstraction has 201272 states and 212461 transitions. [2025-03-03 10:35:38,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 201272 states and 212461 transitions. [2025-03-03 10:35:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-03-03 10:35:38,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:38,562 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:38,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:35:38,563 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:38,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash -102785114, now seen corresponding path program 1 times [2025-03-03 10:35:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577172958] [2025-03-03 10:35:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:38,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-03-03 10:35:38,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-03-03 10:35:38,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:38,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-03 10:35:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577172958] [2025-03-03 10:35:39,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577172958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:39,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:39,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:35:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444959888] [2025-03-03 10:35:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:39,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:35:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:39,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:35:39,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:39,867 INFO L87 Difference]: Start difference. First operand 201272 states and 212461 transitions. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:43,179 INFO L93 Difference]: Finished difference Result 402844 states and 425222 transitions. [2025-03-03 10:35:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:35:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 788 [2025-03-03 10:35:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:43,412 INFO L225 Difference]: With dead ends: 402844 [2025-03-03 10:35:43,412 INFO L226 Difference]: Without dead ends: 201574 [2025-03-03 10:35:43,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:43,510 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 653 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 4031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:43,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1269 Invalid, 4031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:35:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201574 states. [2025-03-03 10:35:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201574 to 201272. [2025-03-03 10:35:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201272 states, 201271 states have (on average 1.0539024499306904) internal successors, (212120), 201271 states have internal predecessors, (212120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201272 states to 201272 states and 212120 transitions. [2025-03-03 10:35:45,634 INFO L78 Accepts]: Start accepts. Automaton has 201272 states and 212120 transitions. Word has length 788 [2025-03-03 10:35:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:45,635 INFO L471 AbstractCegarLoop]: Abstraction has 201272 states and 212120 transitions. [2025-03-03 10:35:45,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 201272 states and 212120 transitions. [2025-03-03 10:35:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2025-03-03 10:35:45,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:45,661 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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] [2025-03-03 10:35:45,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:35:45,661 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:45,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash 558693188, now seen corresponding path program 1 times [2025-03-03 10:35:45,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:45,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222024074] [2025-03-03 10:35:45,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:45,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-03 10:35:45,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-03 10:35:45,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:45,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 952 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-03 10:35:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:46,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222024074] [2025-03-03 10:35:46,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222024074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:46,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:46,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564900882] [2025-03-03 10:35:46,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:46,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:46,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:46,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:46,579 INFO L87 Difference]: Start difference. First operand 201272 states and 212120 transitions. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)