./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label50.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 451c7dc1e9ccbf0e1b2bfff20c93c74c6a2c224dafb02ba3904b999265578105 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:01:59,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:01:59,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:01:59,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:01:59,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:02:00,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:02:00,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:02:00,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:02:00,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:02:00,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:02:00,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:02:00,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:02:00,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:02:00,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:02:00,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:02:00,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:02:00,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:02:00,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:02:00,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:02:00,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:02:00,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:02:00,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:02:00,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:02:00,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:02:00,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:02:00,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:02:00,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:02:00,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:02:00,009 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 -> 451c7dc1e9ccbf0e1b2bfff20c93c74c6a2c224dafb02ba3904b999265578105 [2025-03-03 11:02:00,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:02:00,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:02:00,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:02:00,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:02:00,222 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:02:00,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label50.c [2025-03-03 11:02:01,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1759688/3b9961c8ded54e2ebd7cd90a1ced9a9c/FLAG8b779f79b [2025-03-03 11:02:01,744 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:02:01,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label50.c [2025-03-03 11:02:01,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1759688/3b9961c8ded54e2ebd7cd90a1ced9a9c/FLAG8b779f79b [2025-03-03 11:02:01,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1759688/3b9961c8ded54e2ebd7cd90a1ced9a9c [2025-03-03 11:02:01,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:02:01,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:02:01,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:02:01,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:02:01,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:02:01,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:02:01" (1/1) ... [2025-03-03 11:02:01,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d65918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:01, skipping insertion in model container [2025-03-03 11:02:01,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:02:01" (1/1) ... [2025-03-03 11:02:01,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:02:01,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label50.c[1517,1530] [2025-03-03 11:02:02,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:02:02,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:02:02,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label50.c[1517,1530] [2025-03-03 11:02:02,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:02:02,618 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:02:02,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02 WrapperNode [2025-03-03 11:02:02,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:02:02,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:02:02,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:02:02,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:02:02,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:02,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:02,832 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 11:02:02,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:02:02,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:02:02,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:02:02,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:02:02,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:02,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:02,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,029 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 11:02:03,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:02:03,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:02:03,229 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:02:03,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:02:03,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (1/1) ... [2025-03-03 11:02:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:02:03,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:03,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:02:03,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:02:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:02:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:02:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:02:03,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:02:03,322 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:02:03,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:02:05,689 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 11:02:05,825 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 11:02:05,826 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:02:05,851 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:02:05,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:02:05,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:05 BoogieIcfgContainer [2025-03-03 11:02:05,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:02:05,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:02:05,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:02:05,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:02:05,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:02:01" (1/3) ... [2025-03-03 11:02:05,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9702a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:05, skipping insertion in model container [2025-03-03 11:02:05,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:02" (2/3) ... [2025-03-03 11:02:05,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9702a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:02:05, skipping insertion in model container [2025-03-03 11:02:05,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:02:05" (3/3) ... [2025-03-03 11:02:05,862 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label50.c [2025-03-03 11:02:05,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:02:05,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label50.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:02:05,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:02:05,943 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;@12921f62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:02:05,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:02:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 11:02:05,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:05,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:05,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:05,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2059720599, now seen corresponding path program 1 times [2025-03-03 11:02:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181011998] [2025-03-03 11:02:05,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:06,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 11:02:06,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 11:02:06,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:06,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:06,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:06,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181011998] [2025-03-03 11:02:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181011998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:06,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441284804] [2025-03-03 11:02:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:06,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:06,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:06,144 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:08,176 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-03 11:02:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-03 11:02:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:08,189 INFO L225 Difference]: With dead ends: 1644 [2025-03-03 11:02:08,189 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 11:02:08,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:08,193 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 479 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:08,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 11:02:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 11:02:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-03 11:02:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-03 11:02:08,253 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 9 [2025-03-03 11:02:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:08,254 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-03 11:02:08,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-03 11:02:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 11:02:08,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:08,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:08,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:02:08,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:08,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1637298776, now seen corresponding path program 1 times [2025-03-03 11:02:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926602797] [2025-03-03 11:02:08,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:08,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 11:02:08,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 11:02:08,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:08,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926602797] [2025-03-03 11:02:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926602797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634444464] [2025-03-03 11:02:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:08,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:08,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:08,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:08,511 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:10,110 INFO L93 Difference]: Finished difference Result 2815 states and 4382 transitions. [2025-03-03 11:02:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:10,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-03 11:02:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:10,116 INFO L225 Difference]: With dead ends: 2815 [2025-03-03 11:02:10,116 INFO L226 Difference]: Without dead ends: 1846 [2025-03-03 11:02:10,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:10,118 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:10,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 581 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:02:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-03-03 11:02:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1841. [2025-03-03 11:02:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3505434782608696) internal successors, (2485), 1840 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2485 transitions. [2025-03-03 11:02:10,157 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2485 transitions. Word has length 76 [2025-03-03 11:02:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:10,158 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2485 transitions. [2025-03-03 11:02:10,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2485 transitions. [2025-03-03 11:02:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 11:02:10,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:10,160 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 11:02:10,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:02:10,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:10,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1820205728, now seen corresponding path program 1 times [2025-03-03 11:02:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:10,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921771917] [2025-03-03 11:02:10,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:10,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 11:02:10,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 11:02:10,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:10,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:10,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921771917] [2025-03-03 11:02:10,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921771917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:10,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:10,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033381328] [2025-03-03 11:02:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:10,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:02:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:10,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:02:10,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:10,432 INFO L87 Difference]: Start difference. First operand 1841 states and 2485 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:13,043 INFO L93 Difference]: Finished difference Result 6765 states and 9262 transitions. [2025-03-03 11:02:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:13,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 11:02:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:13,057 INFO L225 Difference]: With dead ends: 6765 [2025-03-03 11:02:13,057 INFO L226 Difference]: Without dead ends: 4926 [2025-03-03 11:02:13,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:02:13,060 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 957 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:13,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 286 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 11:02:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2025-03-03 11:02:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2025-03-03 11:02:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.2866228970045137) internal successors, (6271), 4874 states have internal predecessors, (6271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6271 transitions. [2025-03-03 11:02:13,146 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6271 transitions. Word has length 79 [2025-03-03 11:02:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:13,148 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6271 transitions. [2025-03-03 11:02:13,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6271 transitions. [2025-03-03 11:02:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 11:02:13,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:13,151 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:13,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:02:13,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:13,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1796405861, now seen corresponding path program 1 times [2025-03-03 11:02:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:13,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474369477] [2025-03-03 11:02:13,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:13,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 11:02:13,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 11:02:13,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:13,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 11:02:13,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:13,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474369477] [2025-03-03 11:02:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474369477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:13,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:13,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:02:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11569329] [2025-03-03 11:02:13,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:13,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:13,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:13,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:13,338 INFO L87 Difference]: Start difference. First operand 4875 states and 6271 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:14,758 INFO L93 Difference]: Finished difference Result 14436 states and 18544 transitions. [2025-03-03 11:02:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 150 [2025-03-03 11:02:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:14,779 INFO L225 Difference]: With dead ends: 14436 [2025-03-03 11:02:14,779 INFO L226 Difference]: Without dead ends: 8277 [2025-03-03 11:02:14,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:14,788 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:14,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-03-03 11:02:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6144. [2025-03-03 11:02:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6144 states, 6143 states have (on average 1.1909490476965652) internal successors, (7316), 6143 states have internal predecessors, (7316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6144 states to 6144 states and 7316 transitions. [2025-03-03 11:02:14,878 INFO L78 Accepts]: Start accepts. Automaton has 6144 states and 7316 transitions. Word has length 150 [2025-03-03 11:02:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:14,878 INFO L471 AbstractCegarLoop]: Abstraction has 6144 states and 7316 transitions. [2025-03-03 11:02:14,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6144 states and 7316 transitions. [2025-03-03 11:02:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 11:02:14,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:14,881 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:02:14,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash 133697481, now seen corresponding path program 1 times [2025-03-03 11:02:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:14,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064474965] [2025-03-03 11:02:14,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:14,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:14,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 11:02:14,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 11:02:14,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:14,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 11:02:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064474965] [2025-03-03 11:02:15,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064474965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:15,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:15,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504675887] [2025-03-03 11:02:15,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:15,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:15,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:15,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:15,074 INFO L87 Difference]: Start difference. First operand 6144 states and 7316 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-03 11:02:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:16,599 INFO L93 Difference]: Finished difference Result 14901 states and 17820 transitions. [2025-03-03 11:02:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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 163 [2025-03-03 11:02:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:16,617 INFO L225 Difference]: With dead ends: 14901 [2025-03-03 11:02:16,618 INFO L226 Difference]: Without dead ends: 8759 [2025-03-03 11:02:16,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:16,623 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 543 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:16,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 187 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2025-03-03 11:02:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 8306. [2025-03-03 11:02:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8306 states, 8305 states have (on average 1.201685731487056) internal successors, (9980), 8305 states have internal predecessors, (9980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8306 states to 8306 states and 9980 transitions. [2025-03-03 11:02:16,718 INFO L78 Accepts]: Start accepts. Automaton has 8306 states and 9980 transitions. Word has length 163 [2025-03-03 11:02:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 8306 states and 9980 transitions. [2025-03-03 11:02:16,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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-03 11:02:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 8306 states and 9980 transitions. [2025-03-03 11:02:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 11:02:16,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:16,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:02:16,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1548367629, now seen corresponding path program 1 times [2025-03-03 11:02:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342717342] [2025-03-03 11:02:16,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:16,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 11:02:16,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 11:02:16,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:16,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 11:02:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342717342] [2025-03-03 11:02:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342717342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:16,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:16,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793415312] [2025-03-03 11:02:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:16,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:16,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:16,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:16,844 INFO L87 Difference]: Start difference. First operand 8306 states and 9980 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:18,264 INFO L93 Difference]: Finished difference Result 20865 states and 25614 transitions. [2025-03-03 11:02:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:18,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 166 [2025-03-03 11:02:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:18,288 INFO L225 Difference]: With dead ends: 20865 [2025-03-03 11:02:18,288 INFO L226 Difference]: Without dead ends: 12561 [2025-03-03 11:02:18,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:18,297 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 490 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:18,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 798 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:02:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12561 states. [2025-03-03 11:02:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12561 to 12561. [2025-03-03 11:02:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 12560 states have (on average 1.1890127388535032) internal successors, (14934), 12560 states have internal predecessors, (14934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 14934 transitions. [2025-03-03 11:02:18,444 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 14934 transitions. Word has length 166 [2025-03-03 11:02:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:18,445 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 14934 transitions. [2025-03-03 11:02:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 14934 transitions. [2025-03-03 11:02:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 11:02:18,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:18,447 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:02:18,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash 499134022, now seen corresponding path program 1 times [2025-03-03 11:02:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339772168] [2025-03-03 11:02:18,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:18,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 11:02:18,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 11:02:18,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:18,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 11:02:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339772168] [2025-03-03 11:02:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339772168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627369927] [2025-03-03 11:02:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:18,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:18,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:18,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:18,608 INFO L87 Difference]: Start difference. First operand 12561 states and 14934 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:20,031 INFO L93 Difference]: Finished difference Result 30207 states and 36441 transitions. [2025-03-03 11:02:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 246 [2025-03-03 11:02:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:20,056 INFO L225 Difference]: With dead ends: 30207 [2025-03-03 11:02:20,057 INFO L226 Difference]: Without dead ends: 15947 [2025-03-03 11:02:20,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:20,107 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 388 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:20,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 900 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:02:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2025-03-03 11:02:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 15947. [2025-03-03 11:02:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15947 states, 15946 states have (on average 1.135833437852753) internal successors, (18112), 15946 states have internal predecessors, (18112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15947 states to 15947 states and 18112 transitions. [2025-03-03 11:02:20,331 INFO L78 Accepts]: Start accepts. Automaton has 15947 states and 18112 transitions. Word has length 246 [2025-03-03 11:02:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:20,331 INFO L471 AbstractCegarLoop]: Abstraction has 15947 states and 18112 transitions. [2025-03-03 11:02:20,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 15947 states and 18112 transitions. [2025-03-03 11:02:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 11:02:20,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:20,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:20,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:02:20,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:20,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 437464184, now seen corresponding path program 1 times [2025-03-03 11:02:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66033884] [2025-03-03 11:02:20,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:20,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-03 11:02:20,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-03 11:02:20,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:20,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66033884] [2025-03-03 11:02:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66033884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:20,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:20,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134465048] [2025-03-03 11:02:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:20,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:20,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:20,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:20,585 INFO L87 Difference]: Start difference. First operand 15947 states and 18112 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:22,063 INFO L93 Difference]: Finished difference Result 40012 states and 45817 transitions. [2025-03-03 11:02:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-03-03 11:02:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:22,093 INFO L225 Difference]: With dead ends: 40012 [2025-03-03 11:02:22,094 INFO L226 Difference]: Without dead ends: 23215 [2025-03-03 11:02:22,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:22,107 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 303 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:22,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 835 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23215 states. [2025-03-03 11:02:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23215 to 23205. [2025-03-03 11:02:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23205 states, 23204 states have (on average 1.1145923116704017) internal successors, (25863), 23204 states have internal predecessors, (25863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23205 states to 23205 states and 25863 transitions. [2025-03-03 11:02:22,377 INFO L78 Accepts]: Start accepts. Automaton has 23205 states and 25863 transitions. Word has length 266 [2025-03-03 11:02:22,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:22,379 INFO L471 AbstractCegarLoop]: Abstraction has 23205 states and 25863 transitions. [2025-03-03 11:02:22,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23205 states and 25863 transitions. [2025-03-03 11:02:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-03 11:02:22,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:22,383 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:22,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:02:22,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1240007567, now seen corresponding path program 1 times [2025-03-03 11:02:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272596255] [2025-03-03 11:02:22,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:22,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-03 11:02:22,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-03 11:02:22,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:22,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 11:02:22,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272596255] [2025-03-03 11:02:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272596255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:22,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26932197] [2025-03-03 11:02:22,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:22,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:22,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:22,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:22,669 INFO L87 Difference]: Start difference. First operand 23205 states and 25863 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:24,029 INFO L93 Difference]: Finished difference Result 51965 states and 58332 transitions. [2025-03-03 11:02:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 321 [2025-03-03 11:02:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:24,058 INFO L225 Difference]: With dead ends: 51965 [2025-03-03 11:02:24,058 INFO L226 Difference]: Without dead ends: 27054 [2025-03-03 11:02:24,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:24,076 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 470 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:24,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 859 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27054 states. [2025-03-03 11:02:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27054 to 27047. [2025-03-03 11:02:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27047 states, 27046 states have (on average 1.1157287584115951) internal successors, (30176), 27046 states have internal predecessors, (30176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27047 states to 27047 states and 30176 transitions. [2025-03-03 11:02:24,337 INFO L78 Accepts]: Start accepts. Automaton has 27047 states and 30176 transitions. Word has length 321 [2025-03-03 11:02:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 27047 states and 30176 transitions. [2025-03-03 11:02:24,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27047 states and 30176 transitions. [2025-03-03 11:02:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-03 11:02:24,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:24,344 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 11:02:24,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:02:24,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:24,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1862369643, now seen corresponding path program 1 times [2025-03-03 11:02:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:24,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748373621] [2025-03-03 11:02:24,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:24,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-03 11:02:24,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-03 11:02:24,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:24,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748373621] [2025-03-03 11:02:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748373621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262626166] [2025-03-03 11:02:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:24,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:24,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:24,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:24,633 INFO L87 Difference]: Start difference. First operand 27047 states and 30176 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:26,212 INFO L93 Difference]: Finished difference Result 65213 states and 73040 transitions. [2025-03-03 11:02:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 371 [2025-03-03 11:02:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:26,252 INFO L225 Difference]: With dead ends: 65213 [2025-03-03 11:02:26,252 INFO L226 Difference]: Without dead ends: 38168 [2025-03-03 11:02:26,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:26,274 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 352 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:26,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 708 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:02:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38168 states. [2025-03-03 11:02:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38168 to 35999. [2025-03-03 11:02:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35999 states, 35998 states have (on average 1.123784654703039) internal successors, (40454), 35998 states have internal predecessors, (40454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35999 states to 35999 states and 40454 transitions. [2025-03-03 11:02:26,640 INFO L78 Accepts]: Start accepts. Automaton has 35999 states and 40454 transitions. Word has length 371 [2025-03-03 11:02:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 35999 states and 40454 transitions. [2025-03-03 11:02:26,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 35999 states and 40454 transitions. [2025-03-03 11:02:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 11:02:26,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:26,646 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:02:26,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:02:26,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1759913237, now seen corresponding path program 1 times [2025-03-03 11:02:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368106856] [2025-03-03 11:02:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 11:02:26,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 11:02:26,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:26,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 11:02:26,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:26,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368106856] [2025-03-03 11:02:26,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368106856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:26,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:26,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:26,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127557462] [2025-03-03 11:02:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:26,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:26,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:26,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:26,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:26,948 INFO L87 Difference]: Start difference. First operand 35999 states and 40454 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:28,597 INFO L93 Difference]: Finished difference Result 80979 states and 91163 transitions. [2025-03-03 11:02:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:28,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 372 [2025-03-03 11:02:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:28,641 INFO L225 Difference]: With dead ends: 80979 [2025-03-03 11:02:28,641 INFO L226 Difference]: Without dead ends: 44557 [2025-03-03 11:02:28,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:28,666 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 524 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:28,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 198 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:02:28,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44557 states. [2025-03-03 11:02:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44557 to 35568. [2025-03-03 11:02:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35568 states, 35567 states have (on average 1.1243287316894874) internal successors, (39989), 35567 states have internal predecessors, (39989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35568 states to 35568 states and 39989 transitions. [2025-03-03 11:02:29,007 INFO L78 Accepts]: Start accepts. Automaton has 35568 states and 39989 transitions. Word has length 372 [2025-03-03 11:02:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:29,008 INFO L471 AbstractCegarLoop]: Abstraction has 35568 states and 39989 transitions. [2025-03-03 11:02:29,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 35568 states and 39989 transitions. [2025-03-03 11:02:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-03 11:02:29,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:29,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:29,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:02:29,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1771394071, now seen corresponding path program 1 times [2025-03-03 11:02:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488164071] [2025-03-03 11:02:29,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:29,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-03 11:02:29,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-03 11:02:29,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:29,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 11:02:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:29,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488164071] [2025-03-03 11:02:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488164071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:29,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345702855] [2025-03-03 11:02:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:29,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:29,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:29,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:29,263 INFO L87 Difference]: Start difference. First operand 35568 states and 39989 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:30,661 INFO L93 Difference]: Finished difference Result 77118 states and 86705 transitions. [2025-03-03 11:02:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:30,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 373 [2025-03-03 11:02:30,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:30,699 INFO L225 Difference]: With dead ends: 77118 [2025-03-03 11:02:30,699 INFO L226 Difference]: Without dead ends: 41552 [2025-03-03 11:02:30,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:30,724 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 329 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:30,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 865 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41552 states. [2025-03-03 11:02:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41552 to 40251. [2025-03-03 11:02:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40251 states, 40250 states have (on average 1.1204968944099378) internal successors, (45100), 40250 states have internal predecessors, (45100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40251 states to 40251 states and 45100 transitions. [2025-03-03 11:02:31,096 INFO L78 Accepts]: Start accepts. Automaton has 40251 states and 45100 transitions. Word has length 373 [2025-03-03 11:02:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:31,097 INFO L471 AbstractCegarLoop]: Abstraction has 40251 states and 45100 transitions. [2025-03-03 11:02:31,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 40251 states and 45100 transitions. [2025-03-03 11:02:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-03 11:02:31,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:31,102 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 11:02:31,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -370871195, now seen corresponding path program 1 times [2025-03-03 11:02:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345863406] [2025-03-03 11:02:31,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:31,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-03 11:02:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-03 11:02:31,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:31,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 11:02:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345863406] [2025-03-03 11:02:31,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345863406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:31,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:31,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923760119] [2025-03-03 11:02:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:31,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:31,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:31,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:31,422 INFO L87 Difference]: Start difference. First operand 40251 states and 45100 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:32,792 INFO L93 Difference]: Finished difference Result 93311 states and 105551 transitions. [2025-03-03 11:02:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2025-03-03 11:02:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:32,850 INFO L225 Difference]: With dead ends: 93311 [2025-03-03 11:02:32,850 INFO L226 Difference]: Without dead ends: 50910 [2025-03-03 11:02:32,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:32,880 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 403 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:32,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 690 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50910 states. [2025-03-03 11:02:33,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50910 to 50892. [2025-03-03 11:02:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50892 states, 50891 states have (on average 1.1218683067732997) internal successors, (57093), 50891 states have internal predecessors, (57093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50892 states to 50892 states and 57093 transitions. [2025-03-03 11:02:33,496 INFO L78 Accepts]: Start accepts. Automaton has 50892 states and 57093 transitions. Word has length 404 [2025-03-03 11:02:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:33,497 INFO L471 AbstractCegarLoop]: Abstraction has 50892 states and 57093 transitions. [2025-03-03 11:02:33,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 50892 states and 57093 transitions. [2025-03-03 11:02:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-03 11:02:33,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:33,503 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:33,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:02:33,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:33,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1404625479, now seen corresponding path program 1 times [2025-03-03 11:02:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586313422] [2025-03-03 11:02:33,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:33,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-03 11:02:33,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-03 11:02:33,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:33,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586313422] [2025-03-03 11:02:33,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586313422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:33,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:33,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967311963] [2025-03-03 11:02:33,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:33,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:33,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:33,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:33,674 INFO L87 Difference]: Start difference. First operand 50892 states and 57093 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:35,091 INFO L93 Difference]: Finished difference Result 101346 states and 113690 transitions. [2025-03-03 11:02:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 408 [2025-03-03 11:02:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:35,146 INFO L225 Difference]: With dead ends: 101346 [2025-03-03 11:02:35,146 INFO L226 Difference]: Without dead ends: 50454 [2025-03-03 11:02:35,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:35,182 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 497 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:35,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 741 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:02:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50454 states. [2025-03-03 11:02:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50454 to 50021. [2025-03-03 11:02:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50021 states, 50020 states have (on average 1.0884646141543384) internal successors, (54445), 50020 states have internal predecessors, (54445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50021 states to 50021 states and 54445 transitions. [2025-03-03 11:02:35,734 INFO L78 Accepts]: Start accepts. Automaton has 50021 states and 54445 transitions. Word has length 408 [2025-03-03 11:02:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:35,735 INFO L471 AbstractCegarLoop]: Abstraction has 50021 states and 54445 transitions. [2025-03-03 11:02:35,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 50021 states and 54445 transitions. [2025-03-03 11:02:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-03 11:02:35,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:35,740 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:35,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:02:35,740 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:35,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1869028621, now seen corresponding path program 1 times [2025-03-03 11:02:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:35,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484430240] [2025-03-03 11:02:35,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:35,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-03 11:02:35,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-03 11:02:35,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:35,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:36,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484430240] [2025-03-03 11:02:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484430240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:36,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:36,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471793898] [2025-03-03 11:02:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:36,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:36,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:36,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:36,114 INFO L87 Difference]: Start difference. First operand 50021 states and 54445 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:37,456 INFO L93 Difference]: Finished difference Result 106441 states and 116116 transitions. [2025-03-03 11:02:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:37,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 414 [2025-03-03 11:02:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:37,508 INFO L225 Difference]: With dead ends: 106441 [2025-03-03 11:02:37,508 INFO L226 Difference]: Without dead ends: 56422 [2025-03-03 11:02:37,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:37,523 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 293 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:37,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 798 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:02:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56422 states. [2025-03-03 11:02:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56422 to 52147. [2025-03-03 11:02:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52147 states, 52146 states have (on average 1.0872166609135887) internal successors, (56694), 52146 states have internal predecessors, (56694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52147 states to 52147 states and 56694 transitions. [2025-03-03 11:02:37,959 INFO L78 Accepts]: Start accepts. Automaton has 52147 states and 56694 transitions. Word has length 414 [2025-03-03 11:02:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:37,960 INFO L471 AbstractCegarLoop]: Abstraction has 52147 states and 56694 transitions. [2025-03-03 11:02:37,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 52147 states and 56694 transitions. [2025-03-03 11:02:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-03 11:02:37,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:37,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:02:37,968 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:37,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1023306100, now seen corresponding path program 1 times [2025-03-03 11:02:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107552329] [2025-03-03 11:02:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:37,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-03 11:02:38,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-03 11:02:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:38,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107552329] [2025-03-03 11:02:38,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107552329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:38,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:38,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689983912] [2025-03-03 11:02:38,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:38,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:38,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:38,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:38,403 INFO L87 Difference]: Start difference. First operand 52147 states and 56694 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:39,913 INFO L93 Difference]: Finished difference Result 123900 states and 135399 transitions. [2025-03-03 11:02:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:39,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2025-03-03 11:02:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:39,988 INFO L225 Difference]: With dead ends: 123900 [2025-03-03 11:02:39,988 INFO L226 Difference]: Without dead ends: 71754 [2025-03-03 11:02:40,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:40,011 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 515 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:40,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 324 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71754 states. [2025-03-03 11:02:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71754 to 69594. [2025-03-03 11:02:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69594 states, 69593 states have (on average 1.0915465635911659) internal successors, (75964), 69593 states have internal predecessors, (75964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69594 states to 69594 states and 75964 transitions. [2025-03-03 11:02:40,613 INFO L78 Accepts]: Start accepts. Automaton has 69594 states and 75964 transitions. Word has length 440 [2025-03-03 11:02:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:40,613 INFO L471 AbstractCegarLoop]: Abstraction has 69594 states and 75964 transitions. [2025-03-03 11:02:40,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 69594 states and 75964 transitions. [2025-03-03 11:02:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-03 11:02:40,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:40,621 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:02:40,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:02:40,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:40,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1205963773, now seen corresponding path program 1 times [2025-03-03 11:02:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:40,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854215440] [2025-03-03 11:02:40,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:40,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-03 11:02:40,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-03 11:02:40,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:40,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:02:41,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:41,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854215440] [2025-03-03 11:02:41,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854215440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:41,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118177985] [2025-03-03 11:02:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:41,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:41,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:41,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:41,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:41,090 INFO L87 Difference]: Start difference. First operand 69594 states and 75964 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:42,664 INFO L93 Difference]: Finished difference Result 151117 states and 165072 transitions. [2025-03-03 11:02:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:42,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 442 [2025-03-03 11:02:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:42,750 INFO L225 Difference]: With dead ends: 151117 [2025-03-03 11:02:42,750 INFO L226 Difference]: Without dead ends: 81525 [2025-03-03 11:02:42,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:42,797 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 296 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:42,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 419 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:02:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81525 states. [2025-03-03 11:02:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81525 to 80227. [2025-03-03 11:02:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80227 states, 80226 states have (on average 1.0890982973100989) internal successors, (87374), 80226 states have internal predecessors, (87374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80227 states to 80227 states and 87374 transitions. [2025-03-03 11:02:43,769 INFO L78 Accepts]: Start accepts. Automaton has 80227 states and 87374 transitions. Word has length 442 [2025-03-03 11:02:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:43,769 INFO L471 AbstractCegarLoop]: Abstraction has 80227 states and 87374 transitions. [2025-03-03 11:02:43,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 80227 states and 87374 transitions. [2025-03-03 11:02:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 11:02:43,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:43,780 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:43,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:02:43,780 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:43,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1359779362, now seen corresponding path program 1 times [2025-03-03 11:02:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255235426] [2025-03-03 11:02:43,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:43,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 11:02:43,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 11:02:43,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:43,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 276 proven. 82 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 11:02:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255235426] [2025-03-03 11:02:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255235426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654203015] [2025-03-03 11:02:44,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:44,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:44,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:02:44,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:02:44,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 11:02:44,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 11:02:44,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:44,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:44,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 11:02:44,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:02:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 195 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:44,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:02:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:02:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654203015] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:02:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 5] total 9 [2025-03-03 11:02:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159699146] [2025-03-03 11:02:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:45,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:02:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:45,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:02:45,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:02:45,427 INFO L87 Difference]: Start difference. First operand 80227 states and 87374 transitions. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:47,938 INFO L93 Difference]: Finished difference Result 181745 states and 198562 transitions. [2025-03-03 11:02:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:02:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 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 459 [2025-03-03 11:02:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:48,051 INFO L225 Difference]: With dead ends: 181745 [2025-03-03 11:02:48,052 INFO L226 Difference]: Without dead ends: 99382 [2025-03-03 11:02:48,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 911 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:02:48,100 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1190 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:48,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 186 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:02:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99382 states. [2025-03-03 11:02:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99382 to 84043. [2025-03-03 11:02:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84043 states, 84042 states have (on average 1.0873729801765784) internal successors, (91385), 84042 states have internal predecessors, (91385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84043 states to 84043 states and 91385 transitions. [2025-03-03 11:02:48,981 INFO L78 Accepts]: Start accepts. Automaton has 84043 states and 91385 transitions. Word has length 459 [2025-03-03 11:02:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:48,981 INFO L471 AbstractCegarLoop]: Abstraction has 84043 states and 91385 transitions. [2025-03-03 11:02:48,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 84043 states and 91385 transitions. [2025-03-03 11:02:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-03 11:02:48,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:48,992 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:48,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:02:49,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 11:02:49,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:49,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1444117741, now seen corresponding path program 1 times [2025-03-03 11:02:49,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:49,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352561259] [2025-03-03 11:02:49,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:49,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-03-03 11:02:49,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-03-03 11:02:49,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:49,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 11:02:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352561259] [2025-03-03 11:02:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352561259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:02:49,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:02:49,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:02:49,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078365825] [2025-03-03 11:02:49,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:02:49,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:02:49,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:49,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:02:49,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:49,779 INFO L87 Difference]: Start difference. First operand 84043 states and 91385 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:02:51,320 INFO L93 Difference]: Finished difference Result 180018 states and 195723 transitions. [2025-03-03 11:02:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:02:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 491 [2025-03-03 11:02:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:02:51,597 INFO L225 Difference]: With dead ends: 180018 [2025-03-03 11:02:51,597 INFO L226 Difference]: Without dead ends: 95977 [2025-03-03 11:02:51,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:02:51,632 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 299 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:02:51,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 400 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:02:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95977 states. [2025-03-03 11:02:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95977 to 85745. [2025-03-03 11:02:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85745 states, 85744 states have (on average 1.0847172980033588) internal successors, (93008), 85744 states have internal predecessors, (93008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85745 states to 85745 states and 93008 transitions. [2025-03-03 11:02:52,486 INFO L78 Accepts]: Start accepts. Automaton has 85745 states and 93008 transitions. Word has length 491 [2025-03-03 11:02:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:02:52,487 INFO L471 AbstractCegarLoop]: Abstraction has 85745 states and 93008 transitions. [2025-03-03 11:02:52,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:02:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 85745 states and 93008 transitions. [2025-03-03 11:02:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-03 11:02:52,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:02:52,496 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:02:52,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:02:52,497 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:02:52,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:02:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1879254175, now seen corresponding path program 1 times [2025-03-03 11:02:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:02:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936673142] [2025-03-03 11:02:52,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:02:52,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 11:02:52,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 11:02:52,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:52,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 325 proven. 7 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 11:02:53,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:02:53,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936673142] [2025-03-03 11:02:53,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936673142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:02:53,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573838289] [2025-03-03 11:02:53,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:02:53,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:02:53,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:02:53,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:02:53,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:02:53,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 11:02:53,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 11:02:53,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:02:53,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:02:53,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 11:02:53,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:02:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-03 11:02:53,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:02:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-03 11:02:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573838289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:02:54,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:02:54,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-03 11:02:54,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970135169] [2025-03-03 11:02:54,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:02:54,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 11:02:54,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:02:54,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 11:02:54,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:02:54,286 INFO L87 Difference]: Start difference. First operand 85745 states and 93008 transitions. Second operand has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:01,968 INFO L93 Difference]: Finished difference Result 230258 states and 250472 transitions. [2025-03-03 11:03:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 11:03:01,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 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 498 [2025-03-03 11:03:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:02,132 INFO L225 Difference]: With dead ends: 230258 [2025-03-03 11:03:02,132 INFO L226 Difference]: Without dead ends: 138969 [2025-03-03 11:03:02,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 1001 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-03-03 11:03:02,198 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 7164 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 10139 mSolverCounterSat, 1830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7164 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 11969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1830 IncrementalHoareTripleChecker+Valid, 10139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:02,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7164 Valid, 343 Invalid, 11969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1830 Valid, 10139 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-03-03 11:03:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138969 states. [2025-03-03 11:03:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138969 to 123559. [2025-03-03 11:03:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123559 states, 123558 states have (on average 1.0687450428139011) internal successors, (132052), 123558 states have internal predecessors, (132052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123559 states to 123559 states and 132052 transitions. [2025-03-03 11:03:03,749 INFO L78 Accepts]: Start accepts. Automaton has 123559 states and 132052 transitions. Word has length 498 [2025-03-03 11:03:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:03,749 INFO L471 AbstractCegarLoop]: Abstraction has 123559 states and 132052 transitions. [2025-03-03 11:03:03,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 123559 states and 132052 transitions. [2025-03-03 11:03:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-03 11:03:03,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:03,764 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:03,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 11:03:03,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-03 11:03:03,965 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:03,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash 361619471, now seen corresponding path program 1 times [2025-03-03 11:03:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523217417] [2025-03-03 11:03:03,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:03,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:04,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 11:03:04,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 11:03:04,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:04,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 11:03:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523217417] [2025-03-03 11:03:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523217417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:04,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845471878] [2025-03-03 11:03:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:04,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:04,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:04,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:04,214 INFO L87 Difference]: Start difference. First operand 123559 states and 132052 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:05,946 INFO L93 Difference]: Finished difference Result 258198 states and 275728 transitions. [2025-03-03 11:03:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:05,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 535 [2025-03-03 11:03:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:06,106 INFO L225 Difference]: With dead ends: 258198 [2025-03-03 11:03:06,106 INFO L226 Difference]: Without dead ends: 135066 [2025-03-03 11:03:06,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:06,185 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 333 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:06,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 137 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135066 states. [2025-03-03 11:03:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135066 to 115015. [2025-03-03 11:03:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115015 states, 115014 states have (on average 1.0655137635418297) internal successors, (122549), 115014 states have internal predecessors, (122549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115015 states to 115015 states and 122549 transitions. [2025-03-03 11:03:07,729 INFO L78 Accepts]: Start accepts. Automaton has 115015 states and 122549 transitions. Word has length 535 [2025-03-03 11:03:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:07,729 INFO L471 AbstractCegarLoop]: Abstraction has 115015 states and 122549 transitions. [2025-03-03 11:03:07,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 115015 states and 122549 transitions. [2025-03-03 11:03:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-03 11:03:07,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:07,742 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:03:07,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:03:07,743 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:07,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -168996489, now seen corresponding path program 1 times [2025-03-03 11:03:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466245943] [2025-03-03 11:03:07,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:07,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-03 11:03:07,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-03 11:03:07,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:07,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 717 proven. 179 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 11:03:08,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466245943] [2025-03-03 11:03:08,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466245943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383426558] [2025-03-03 11:03:08,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:08,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:08,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:08,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 11:03:08,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-03 11:03:08,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-03 11:03:08,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:08,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:08,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:03:08,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 11:03:08,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:03:08,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383426558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:08,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:03:08,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 11:03:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992906324] [2025-03-03 11:03:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:08,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:08,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:03:08,666 INFO L87 Difference]: Start difference. First operand 115015 states and 122549 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:10,143 INFO L93 Difference]: Finished difference Result 232587 states and 247853 transitions. [2025-03-03 11:03:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:10,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 592 [2025-03-03 11:03:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:10,281 INFO L225 Difference]: With dead ends: 232587 [2025-03-03 11:03:10,281 INFO L226 Difference]: Without dead ends: 117999 [2025-03-03 11:03:10,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:03:10,350 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 267 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:10,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 293 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 11:03:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117999 states. [2025-03-03 11:03:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117999 to 106928. [2025-03-03 11:03:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106928 states, 106927 states have (on average 1.0651753065175307) internal successors, (113896), 106927 states have internal predecessors, (113896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106928 states to 106928 states and 113896 transitions. [2025-03-03 11:03:11,660 INFO L78 Accepts]: Start accepts. Automaton has 106928 states and 113896 transitions. Word has length 592 [2025-03-03 11:03:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:11,661 INFO L471 AbstractCegarLoop]: Abstraction has 106928 states and 113896 transitions. [2025-03-03 11:03:11,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 106928 states and 113896 transitions. [2025-03-03 11:03:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2025-03-03 11:03:11,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:11,697 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:11,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 11:03:11,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:11,897 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -408233266, now seen corresponding path program 1 times [2025-03-03 11:03:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177892136] [2025-03-03 11:03:11,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:12,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 723 statements into 1 equivalence classes. [2025-03-03 11:03:12,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 723 of 723 statements. [2025-03-03 11:03:12,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:12,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-03 11:03:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177892136] [2025-03-03 11:03:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177892136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:12,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001816828] [2025-03-03 11:03:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:12,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:12,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:12,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:12,285 INFO L87 Difference]: Start difference. First operand 106928 states and 113896 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:13,737 INFO L93 Difference]: Finished difference Result 214714 states and 228785 transitions. [2025-03-03 11:03:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:13,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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 723 [2025-03-03 11:03:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:13,841 INFO L225 Difference]: With dead ends: 214714 [2025-03-03 11:03:13,841 INFO L226 Difference]: Without dead ends: 108213 [2025-03-03 11:03:13,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:13,891 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 492 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:13,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 655 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:03:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108213 states. [2025-03-03 11:03:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108213 to 106929. [2025-03-03 11:03:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106929 states, 106928 states have (on average 1.0573376477629808) internal successors, (113059), 106928 states have internal predecessors, (113059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106929 states to 106929 states and 113059 transitions. [2025-03-03 11:03:15,238 INFO L78 Accepts]: Start accepts. Automaton has 106929 states and 113059 transitions. Word has length 723 [2025-03-03 11:03:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:15,238 INFO L471 AbstractCegarLoop]: Abstraction has 106929 states and 113059 transitions. [2025-03-03 11:03:15,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 106929 states and 113059 transitions. [2025-03-03 11:03:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-03-03 11:03:15,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:15,264 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 11:03:15,264 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:15,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash 297482799, now seen corresponding path program 1 times [2025-03-03 11:03:15,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:15,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322081996] [2025-03-03 11:03:15,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:15,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-03 11:03:15,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-03 11:03:15,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:15,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 11:03:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322081996] [2025-03-03 11:03:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322081996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 11:03:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606769614] [2025-03-03 11:03:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:03:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:03:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:03:16,670 INFO L87 Difference]: Start difference. First operand 106929 states and 113059 transitions. Second operand has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:19,105 INFO L93 Difference]: Finished difference Result 201923 states and 213411 transitions. [2025-03-03 11:03:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 11:03:19,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 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 756 [2025-03-03 11:03:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:19,201 INFO L225 Difference]: With dead ends: 201923 [2025-03-03 11:03:19,201 INFO L226 Difference]: Without dead ends: 95420 [2025-03-03 11:03:19,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:03:19,238 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1557 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 4371 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 4455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 4371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:19,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 252 Invalid, 4455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 4371 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:03:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95420 states. [2025-03-03 11:03:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95420 to 93705. [2025-03-03 11:03:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93705 states, 93704 states have (on average 1.056176897464356) internal successors, (98968), 93704 states have internal predecessors, (98968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93705 states to 93705 states and 98968 transitions. [2025-03-03 11:03:20,143 INFO L78 Accepts]: Start accepts. Automaton has 93705 states and 98968 transitions. Word has length 756 [2025-03-03 11:03:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 93705 states and 98968 transitions. [2025-03-03 11:03:20,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 93705 states and 98968 transitions. [2025-03-03 11:03:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2025-03-03 11:03:20,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:20,167 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 11:03:20,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 11:03:20,168 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:20,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash -720327474, now seen corresponding path program 1 times [2025-03-03 11:03:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:20,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979951856] [2025-03-03 11:03:20,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:20,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:20,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-03-03 11:03:20,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-03-03 11:03:20,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:20,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 960 proven. 72 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-03 11:03:21,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:21,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979951856] [2025-03-03 11:03:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979951856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032858167] [2025-03-03 11:03:21,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:21,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:21,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:21,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 11:03:21,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-03-03 11:03:21,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-03-03 11:03:21,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:21,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:21,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:03:21,308 INFO L279 TraceCheckSpWp]: Computing forward predicates...