./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label32.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 da6307e18962eea94383e9cef9de875e55374f6b4142b055a170057bc7246c1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:53:01,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:53:02,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:53:02,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:53:02,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:53:02,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:53:02,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:53:02,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:53:02,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:53:02,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:53:02,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:53:02,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:53:02,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:53:02,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:53:02,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:53:02,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:53:02,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:53:02,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:53:02,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:53:02,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:53:02,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:53:02,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:53:02,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:53:02,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:53:02,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:53:02,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:53:02,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:53:02,046 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 -> da6307e18962eea94383e9cef9de875e55374f6b4142b055a170057bc7246c1d [2025-03-08 01:53:02,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:53:02,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:53:02,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:53:02,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:53:02,288 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:53:02,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label32.c [2025-03-08 01:53:03,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524e2f12d/6de58f9cc80a49f293c73fe45fbc90aa/FLAG83a2c8722 [2025-03-08 01:53:03,964 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:53:03,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label32.c [2025-03-08 01:53:03,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524e2f12d/6de58f9cc80a49f293c73fe45fbc90aa/FLAG83a2c8722 [2025-03-08 01:53:04,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/524e2f12d/6de58f9cc80a49f293c73fe45fbc90aa [2025-03-08 01:53:04,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:53:04,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:53:04,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:53:04,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:53:04,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:53:04,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:04" (1/1) ... [2025-03-08 01:53:04,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f98fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:04, skipping insertion in model container [2025-03-08 01:53:04,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:04" (1/1) ... [2025-03-08 01:53:04,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:53:04,289 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/Problem13_label32.c[1533,1546] [2025-03-08 01:53:04,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:53:04,833 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:53:04,843 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/Problem13_label32.c[1533,1546] [2025-03-08 01:53:05,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:53:05,162 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:53:05,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05 WrapperNode [2025-03-08 01:53:05,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:53:05,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:53:05,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:53:05,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:53:05,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:05,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:05,541 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:53:05,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:53:05,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:53:05,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:53:05,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:53:05,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:05,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:05,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:05,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:53:05,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:05,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:06,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:06,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:06,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:06,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:06,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:53:06,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:53:06,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:53:06,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:53:06,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (1/1) ... [2025-03-08 01:53:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:53:06,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:53:06,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:53:06,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:53:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:53:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:53:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:53:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:53:06,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:53:06,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:53:10,253 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:53:10,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:53:10,255 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:53:10,383 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:53:10,383 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:53:10,414 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:53:10,414 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:53:10,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:10 BoogieIcfgContainer [2025-03-08 01:53:10,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:53:10,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:53:10,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:53:10,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:53:10,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:53:04" (1/3) ... [2025-03-08 01:53:10,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592a8175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:10, skipping insertion in model container [2025-03-08 01:53:10,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:05" (2/3) ... [2025-03-08 01:53:10,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592a8175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:10, skipping insertion in model container [2025-03-08 01:53:10,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:10" (3/3) ... [2025-03-08 01:53:10,423 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label32.c [2025-03-08 01:53:10,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:53:10,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label32.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:53:10,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:53:10,515 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;@77432eaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:53:10,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:53:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 01:53:10,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:10,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:10,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:10,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 44891771, now seen corresponding path program 1 times [2025-03-08 01:53:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217158812] [2025-03-08 01:53:10,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:10,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 01:53:10,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 01:53:10,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:10,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217158812] [2025-03-08 01:53:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217158812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255076096] [2025-03-08 01:53:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:10,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:10,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:10,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:10,695 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:13,785 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-03-08 01:53:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-08 01:53:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:13,801 INFO L225 Difference]: With dead ends: 3035 [2025-03-08 01:53:13,801 INFO L226 Difference]: Without dead ends: 1873 [2025-03-08 01:53:13,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:13,810 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 897 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:13,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 01:53:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-03-08 01:53:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-03-08 01:53:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-03-08 01:53:13,902 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 8 [2025-03-08 01:53:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:13,903 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-03-08 01:53:13,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-03-08 01:53:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 01:53:13,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:13,905 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 01:53:13,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:53:13,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1832810256, now seen corresponding path program 1 times [2025-03-08 01:53:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025949695] [2025-03-08 01:53:13,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 01:53:13,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 01:53:13,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:13,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:14,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025949695] [2025-03-08 01:53:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025949695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:14,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180341518] [2025-03-08 01:53:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:14,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:14,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:14,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:14,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:14,184 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:17,125 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-03-08 01:53:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:17,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-08 01:53:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:17,136 INFO L225 Difference]: With dead ends: 5317 [2025-03-08 01:53:17,136 INFO L226 Difference]: Without dead ends: 3460 [2025-03-08 01:53:17,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:17,140 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:17,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 01:53:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-03-08 01:53:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-03-08 01:53:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-03-08 01:53:17,211 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 80 [2025-03-08 01:53:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:17,211 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-03-08 01:53:17,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-03-08 01:53:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 01:53:17,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:17,215 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 01:53:17,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:53:17,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:17,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash -377682088, now seen corresponding path program 1 times [2025-03-08 01:53:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:17,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851758629] [2025-03-08 01:53:17,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:17,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 01:53:17,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 01:53:17,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:17,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851758629] [2025-03-08 01:53:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851758629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815934322] [2025-03-08 01:53:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:17,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:17,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:17,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:17,398 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:20,138 INFO L93 Difference]: Finished difference Result 10095 states and 13939 transitions. [2025-03-08 01:53:20,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:20,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-08 01:53:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:20,155 INFO L225 Difference]: With dead ends: 10095 [2025-03-08 01:53:20,156 INFO L226 Difference]: Without dead ends: 6638 [2025-03-08 01:53:20,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:20,159 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:20,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 903 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:53:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-03-08 01:53:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6631. [2025-03-08 01:53:20,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-03-08 01:53:20,239 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 94 [2025-03-08 01:53:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:20,240 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-03-08 01:53:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-03-08 01:53:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 01:53:20,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:20,241 INFO L218 NwaCegarLoop]: trace histogram [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-08 01:53:20,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:53:20,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:20,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1646705454, now seen corresponding path program 1 times [2025-03-08 01:53:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:20,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597379009] [2025-03-08 01:53:20,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:20,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 01:53:20,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 01:53:20,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:20,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:20,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:20,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597379009] [2025-03-08 01:53:20,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597379009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:20,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:20,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:20,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017090407] [2025-03-08 01:53:20,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:20,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:20,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:20,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:20,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:20,365 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:22,731 INFO L93 Difference]: Finished difference Result 16437 states and 21419 transitions. [2025-03-08 01:53:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 01:53:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:22,757 INFO L225 Difference]: With dead ends: 16437 [2025-03-08 01:53:22,757 INFO L226 Difference]: Without dead ends: 9808 [2025-03-08 01:53:22,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:22,765 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1030 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:22,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 831 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:53:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9808 states. [2025-03-08 01:53:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9808 to 9797. [2025-03-08 01:53:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9797 states, 9796 states have (on average 1.273887300939159) internal successors, (12479), 9796 states have internal predecessors, (12479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 12479 transitions. [2025-03-08 01:53:22,884 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 12479 transitions. Word has length 97 [2025-03-08 01:53:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:22,884 INFO L471 AbstractCegarLoop]: Abstraction has 9797 states and 12479 transitions. [2025-03-08 01:53:22,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 12479 transitions. [2025-03-08 01:53:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 01:53:22,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:22,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:22,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:53:22,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:22,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:22,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1629124512, now seen corresponding path program 1 times [2025-03-08 01:53:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124646314] [2025-03-08 01:53:22,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:22,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 01:53:22,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 01:53:22,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:22,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124646314] [2025-03-08 01:53:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124646314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735727228] [2025-03-08 01:53:23,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:53:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:23,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:53:23,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:53:23,440 INFO L87 Difference]: Start difference. First operand 9797 states and 12479 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:27,494 INFO L93 Difference]: Finished difference Result 29891 states and 37880 transitions. [2025-03-08 01:53:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:53:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2025-03-08 01:53:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:27,534 INFO L225 Difference]: With dead ends: 29891 [2025-03-08 01:53:27,534 INFO L226 Difference]: Without dead ends: 20096 [2025-03-08 01:53:27,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:53:27,547 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 2127 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 5795 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 6341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 5795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:27,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 1311 Invalid, 6341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 5795 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 01:53:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20096 states. [2025-03-08 01:53:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20096 to 20066. [2025-03-08 01:53:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20066 states, 20065 states have (on average 1.1846997258908547) internal successors, (23771), 20065 states have internal predecessors, (23771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20066 states to 20066 states and 23771 transitions. [2025-03-08 01:53:27,818 INFO L78 Accepts]: Start accepts. Automaton has 20066 states and 23771 transitions. Word has length 174 [2025-03-08 01:53:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:27,819 INFO L471 AbstractCegarLoop]: Abstraction has 20066 states and 23771 transitions. [2025-03-08 01:53:27,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20066 states and 23771 transitions. [2025-03-08 01:53:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 01:53:27,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:27,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:53:27,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:27,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1530325348, now seen corresponding path program 1 times [2025-03-08 01:53:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000104723] [2025-03-08 01:53:27,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:27,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 01:53:27,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 01:53:27,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:27,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:27,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:27,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000104723] [2025-03-08 01:53:27,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000104723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:27,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583520310] [2025-03-08 01:53:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:27,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:27,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:27,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:27,967 INFO L87 Difference]: Start difference. First operand 20066 states and 23771 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:30,648 INFO L93 Difference]: Finished difference Result 45653 states and 54286 transitions. [2025-03-08 01:53:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:30,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-03-08 01:53:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:30,690 INFO L225 Difference]: With dead ends: 45653 [2025-03-08 01:53:30,691 INFO L226 Difference]: Without dead ends: 26376 [2025-03-08 01:53:30,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:30,709 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:30,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 950 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:53:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26376 states. [2025-03-08 01:53:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26376 to 25578. [2025-03-08 01:53:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25578 states, 25577 states have (on average 1.1777378113148531) internal successors, (30123), 25577 states have internal predecessors, (30123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25578 states to 25578 states and 30123 transitions. [2025-03-08 01:53:31,094 INFO L78 Accepts]: Start accepts. Automaton has 25578 states and 30123 transitions. Word has length 207 [2025-03-08 01:53:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:31,095 INFO L471 AbstractCegarLoop]: Abstraction has 25578 states and 30123 transitions. [2025-03-08 01:53:31,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 25578 states and 30123 transitions. [2025-03-08 01:53:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 01:53:31,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:31,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:31,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:53:31,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:31,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -703422733, now seen corresponding path program 1 times [2025-03-08 01:53:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:31,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479092275] [2025-03-08 01:53:31,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:31,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 01:53:31,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 01:53:31,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:31,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479092275] [2025-03-08 01:53:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479092275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:31,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:31,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:31,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113738973] [2025-03-08 01:53:31,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:31,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:31,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:31,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:31,344 INFO L87 Difference]: Start difference. First operand 25578 states and 30123 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:33,528 INFO L93 Difference]: Finished difference Result 51187 states and 60304 transitions. [2025-03-08 01:53:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-03-08 01:53:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:33,562 INFO L225 Difference]: With dead ends: 51187 [2025-03-08 01:53:33,562 INFO L226 Difference]: Without dead ends: 26398 [2025-03-08 01:53:33,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:33,583 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 722 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:33,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1918 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 01:53:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26398 states. [2025-03-08 01:53:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26398 to 26366. [2025-03-08 01:53:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26366 states, 26365 states have (on average 1.161236487767874) internal successors, (30616), 26365 states have internal predecessors, (30616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26366 states to 26366 states and 30616 transitions. [2025-03-08 01:53:33,943 INFO L78 Accepts]: Start accepts. Automaton has 26366 states and 30616 transitions. Word has length 270 [2025-03-08 01:53:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:33,943 INFO L471 AbstractCegarLoop]: Abstraction has 26366 states and 30616 transitions. [2025-03-08 01:53:33,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26366 states and 30616 transitions. [2025-03-08 01:53:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-08 01:53:33,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:33,949 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:33,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:53:33,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:33,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2009745945, now seen corresponding path program 1 times [2025-03-08 01:53:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473180422] [2025-03-08 01:53:33,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:33,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-08 01:53:33,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-08 01:53:33,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:33,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:53:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:34,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473180422] [2025-03-08 01:53:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473180422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672311596] [2025-03-08 01:53:34,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:34,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:53:34,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:34,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:53:34,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:53:34,138 INFO L87 Difference]: Start difference. First operand 26366 states and 30616 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:39,402 INFO L93 Difference]: Finished difference Result 77344 states and 91883 transitions. [2025-03-08 01:53:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:53:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 296 [2025-03-08 01:53:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:39,457 INFO L225 Difference]: With dead ends: 77344 [2025-03-08 01:53:39,457 INFO L226 Difference]: Without dead ends: 51767 [2025-03-08 01:53:39,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:53:39,472 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 1709 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 7166 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 8156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 7166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:39,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1123 Invalid, 8156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 7166 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 01:53:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51767 states. [2025-03-08 01:53:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51767 to 51641. [2025-03-08 01:53:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51641 states, 51640 states have (on average 1.1673315259488768) internal successors, (60281), 51640 states have internal predecessors, (60281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51641 states to 51641 states and 60281 transitions. [2025-03-08 01:53:39,891 INFO L78 Accepts]: Start accepts. Automaton has 51641 states and 60281 transitions. Word has length 296 [2025-03-08 01:53:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:39,892 INFO L471 AbstractCegarLoop]: Abstraction has 51641 states and 60281 transitions. [2025-03-08 01:53:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 51641 states and 60281 transitions. [2025-03-08 01:53:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-08 01:53:39,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:39,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:39,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:53:39,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:39,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1881298220, now seen corresponding path program 1 times [2025-03-08 01:53:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76565173] [2025-03-08 01:53:39,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:39,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-08 01:53:39,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-08 01:53:39,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 01:53:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76565173] [2025-03-08 01:53:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76565173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138277450] [2025-03-08 01:53:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:40,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:40,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:40,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:40,137 INFO L87 Difference]: Start difference. First operand 51641 states and 60281 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:42,888 INFO L93 Difference]: Finished difference Result 115093 states and 136212 transitions. [2025-03-08 01:53:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 299 [2025-03-08 01:53:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:42,966 INFO L225 Difference]: With dead ends: 115093 [2025-03-08 01:53:42,966 INFO L226 Difference]: Without dead ends: 64241 [2025-03-08 01:53:43,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:43,003 INFO L435 NwaCegarLoop]: 1834 mSDtfsCounter, 848 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:43,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1985 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:53:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64241 states. [2025-03-08 01:53:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64241 to 63445. [2025-03-08 01:53:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63445 states, 63444 states have (on average 1.1514406405649076) internal successors, (73052), 63444 states have internal predecessors, (73052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63445 states to 63445 states and 73052 transitions. [2025-03-08 01:53:43,786 INFO L78 Accepts]: Start accepts. Automaton has 63445 states and 73052 transitions. Word has length 299 [2025-03-08 01:53:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:43,786 INFO L471 AbstractCegarLoop]: Abstraction has 63445 states and 73052 transitions. [2025-03-08 01:53:43,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 63445 states and 73052 transitions. [2025-03-08 01:53:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 01:53:43,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:43,791 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:43,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:53:43,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:43,795 INFO L85 PathProgramCache]: Analyzing trace with hash -851084864, now seen corresponding path program 1 times [2025-03-08 01:53:43,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:43,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619699070] [2025-03-08 01:53:43,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:43,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:43,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 01:53:43,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 01:53:43,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:43,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:53:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:43,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619699070] [2025-03-08 01:53:43,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619699070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:43,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:43,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:43,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639389236] [2025-03-08 01:53:43,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:43,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:43,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:43,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:43,968 INFO L87 Difference]: Start difference. First operand 63445 states and 73052 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:46,814 INFO L93 Difference]: Finished difference Result 136320 states and 159242 transitions. [2025-03-08 01:53:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 324 [2025-03-08 01:53:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:46,909 INFO L225 Difference]: With dead ends: 136320 [2025-03-08 01:53:46,909 INFO L226 Difference]: Without dead ends: 73664 [2025-03-08 01:53:46,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:46,943 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1157 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:46,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1560 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:53:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73664 states. [2025-03-08 01:53:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73664 to 73663. [2025-03-08 01:53:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73663 states, 73662 states have (on average 1.1366647660937796) internal successors, (83729), 73662 states have internal predecessors, (83729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73663 states to 73663 states and 83729 transitions. [2025-03-08 01:53:47,779 INFO L78 Accepts]: Start accepts. Automaton has 73663 states and 83729 transitions. Word has length 324 [2025-03-08 01:53:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 73663 states and 83729 transitions. [2025-03-08 01:53:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 73663 states and 83729 transitions. [2025-03-08 01:53:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-08 01:53:47,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:47,789 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:47,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:53:47,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1330555546, now seen corresponding path program 1 times [2025-03-08 01:53:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:47,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020606534] [2025-03-08 01:53:47,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:47,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-08 01:53:47,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-08 01:53:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:47,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:53:48,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:48,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020606534] [2025-03-08 01:53:48,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020606534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:48,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:48,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:48,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118876477] [2025-03-08 01:53:48,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:48,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:48,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:48,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:48,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:48,114 INFO L87 Difference]: Start difference. First operand 73663 states and 83729 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:51,221 INFO L93 Difference]: Finished difference Result 146532 states and 166663 transitions. [2025-03-08 01:53:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 402 [2025-03-08 01:53:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:51,311 INFO L225 Difference]: With dead ends: 146532 [2025-03-08 01:53:51,311 INFO L226 Difference]: Without dead ends: 73658 [2025-03-08 01:53:51,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:51,336 INFO L435 NwaCegarLoop]: 1708 mSDtfsCounter, 796 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2499 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:51,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1851 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2499 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:53:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73658 states. [2025-03-08 01:53:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73658 to 72850. [2025-03-08 01:53:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72850 states, 72849 states have (on average 1.0964872544578512) internal successors, (79878), 72849 states have internal predecessors, (79878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72850 states to 72850 states and 79878 transitions. [2025-03-08 01:53:52,118 INFO L78 Accepts]: Start accepts. Automaton has 72850 states and 79878 transitions. Word has length 402 [2025-03-08 01:53:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:52,118 INFO L471 AbstractCegarLoop]: Abstraction has 72850 states and 79878 transitions. [2025-03-08 01:53:52,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 72850 states and 79878 transitions. [2025-03-08 01:53:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-08 01:53:52,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:52,127 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:53:52,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:53:52,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:52,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash 352201171, now seen corresponding path program 1 times [2025-03-08 01:53:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376109300] [2025-03-08 01:53:52,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 01:53:52,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 01:53:52,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:52,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:53:52,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:52,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376109300] [2025-03-08 01:53:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376109300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476617058] [2025-03-08 01:53:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:52,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:52,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:52,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:52,313 INFO L87 Difference]: Start difference. First operand 72850 states and 79878 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:55,128 INFO L93 Difference]: Finished difference Result 183453 states and 201160 transitions. [2025-03-08 01:53:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:55,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 430 [2025-03-08 01:53:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:55,266 INFO L225 Difference]: With dead ends: 183453 [2025-03-08 01:53:55,266 INFO L226 Difference]: Without dead ends: 107452 [2025-03-08 01:53:55,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:55,319 INFO L435 NwaCegarLoop]: 1734 mSDtfsCounter, 865 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:55,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1864 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:53:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107452 states. [2025-03-08 01:53:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107452 to 103509. [2025-03-08 01:53:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103509 states, 103508 states have (on average 1.0760810758588708) internal successors, (111383), 103508 states have internal predecessors, (111383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103509 states to 103509 states and 111383 transitions. [2025-03-08 01:53:56,604 INFO L78 Accepts]: Start accepts. Automaton has 103509 states and 111383 transitions. Word has length 430 [2025-03-08 01:53:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:56,605 INFO L471 AbstractCegarLoop]: Abstraction has 103509 states and 111383 transitions. [2025-03-08 01:53:56,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:53:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 103509 states and 111383 transitions. [2025-03-08 01:53:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-08 01:53:56,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:56,611 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:56,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:53:56,612 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:56,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1623581642, now seen corresponding path program 1 times [2025-03-08 01:53:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:56,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936019004] [2025-03-08 01:53:56,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:56,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-08 01:53:56,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-08 01:53:56,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:56,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:53:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:57,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936019004] [2025-03-08 01:53:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936019004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:57,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:53:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196782896] [2025-03-08 01:53:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:53:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:57,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:53:57,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:53:57,100 INFO L87 Difference]: Start difference. First operand 103509 states and 111383 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:05,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 01:54:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:06,239 INFO L93 Difference]: Finished difference Result 278041 states and 299190 transitions. [2025-03-08 01:54:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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 454 [2025-03-08 01:54:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:06,443 INFO L225 Difference]: With dead ends: 278041 [2025-03-08 01:54:06,443 INFO L226 Difference]: Without dead ends: 175321 [2025-03-08 01:54:06,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:06,514 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1907 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 1100 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 7162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 6061 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:06,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 628 Invalid, 7162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 6061 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2025-03-08 01:54:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175321 states. [2025-03-08 01:54:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175321 to 164931. [2025-03-08 01:54:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164931 states, 164930 states have (on average 1.0734311526101983) internal successors, (177041), 164930 states have internal predecessors, (177041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164931 states to 164931 states and 177041 transitions. [2025-03-08 01:54:08,110 INFO L78 Accepts]: Start accepts. Automaton has 164931 states and 177041 transitions. Word has length 454 [2025-03-08 01:54:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:08,111 INFO L471 AbstractCegarLoop]: Abstraction has 164931 states and 177041 transitions. [2025-03-08 01:54:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 164931 states and 177041 transitions. [2025-03-08 01:54:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-08 01:54:08,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:08,123 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:08,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:54:08,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:08,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2072046368, now seen corresponding path program 1 times [2025-03-08 01:54:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:08,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755501259] [2025-03-08 01:54:08,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:08,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-08 01:54:08,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-08 01:54:08,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:08,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:54:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755501259] [2025-03-08 01:54:08,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755501259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:08,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:08,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298618873] [2025-03-08 01:54:08,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:08,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:54:08,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:08,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:54:08,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:08,894 INFO L87 Difference]: Start difference. First operand 164931 states and 177041 transitions. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:12,126 INFO L93 Difference]: Finished difference Result 337732 states and 362239 transitions. [2025-03-08 01:54:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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 475 [2025-03-08 01:54:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:12,316 INFO L225 Difference]: With dead ends: 337732 [2025-03-08 01:54:12,316 INFO L226 Difference]: Without dead ends: 171226 [2025-03-08 01:54:12,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:12,426 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 1504 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 4167 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 4167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:12,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 948 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 4167 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:54:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171226 states. [2025-03-08 01:54:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171226 to 169649. [2025-03-08 01:54:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169649 states, 169648 states have (on average 1.0657714797698765) internal successors, (180806), 169648 states have internal predecessors, (180806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169649 states to 169649 states and 180806 transitions. [2025-03-08 01:54:14,544 INFO L78 Accepts]: Start accepts. Automaton has 169649 states and 180806 transitions. Word has length 475 [2025-03-08 01:54:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:14,545 INFO L471 AbstractCegarLoop]: Abstraction has 169649 states and 180806 transitions. [2025-03-08 01:54:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 169649 states and 180806 transitions. [2025-03-08 01:54:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-08 01:54:14,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:14,556 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:14,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:54:14,556 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:14,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash -724753037, now seen corresponding path program 1 times [2025-03-08 01:54:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:14,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384609844] [2025-03-08 01:54:14,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:14,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-08 01:54:14,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-08 01:54:14,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 01:54:15,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:15,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384609844] [2025-03-08 01:54:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384609844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502709430] [2025-03-08 01:54:15,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:15,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:15,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:15,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:15,069 INFO L87 Difference]: Start difference. First operand 169649 states and 180806 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:18,556 INFO L93 Difference]: Finished difference Result 418817 states and 446237 transitions. [2025-03-08 01:54:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 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 495 [2025-03-08 01:54:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:18,845 INFO L225 Difference]: With dead ends: 418817 [2025-03-08 01:54:18,845 INFO L226 Difference]: Without dead ends: 249957 [2025-03-08 01:54:18,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:18,893 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 581 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 3164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:18,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 652 Invalid, 3164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 2740 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:54:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249957 states. [2025-03-08 01:54:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249957 to 237351. [2025-03-08 01:54:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237351 states, 237350 states have (on average 1.0627343585422373) internal successors, (252240), 237350 states have internal predecessors, (252240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237351 states to 237351 states and 252240 transitions. [2025-03-08 01:54:21,652 INFO L78 Accepts]: Start accepts. Automaton has 237351 states and 252240 transitions. Word has length 495 [2025-03-08 01:54:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 237351 states and 252240 transitions. [2025-03-08 01:54:21,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 237351 states and 252240 transitions. [2025-03-08 01:54:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-08 01:54:21,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:21,661 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:21,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:54:21,662 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:21,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2068183129, now seen corresponding path program 1 times [2025-03-08 01:54:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893746923] [2025-03-08 01:54:21,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:21,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-08 01:54:21,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-08 01:54:21,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:21,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-08 01:54:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893746923] [2025-03-08 01:54:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893746923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688222919] [2025-03-08 01:54:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:22,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:22,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:22,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:22,132 INFO L87 Difference]: Start difference. First operand 237351 states and 252240 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:25,509 INFO L93 Difference]: Finished difference Result 471544 states and 501241 transitions. [2025-03-08 01:54:25,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:25,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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-08 01:54:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:25,840 INFO L225 Difference]: With dead ends: 471544 [2025-03-08 01:54:25,840 INFO L226 Difference]: Without dead ends: 234982 [2025-03-08 01:54:25,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:25,964 INFO L435 NwaCegarLoop]: 1326 mSDtfsCounter, 854 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:25,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1402 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:54:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234982 states.