./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label39.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 e75b25accfa51338058ad16425748718d01a5d94bd667d18c22ba63a9d75c3da --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:01:28,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:01:28,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:01:28,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:01:28,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:01:28,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:01:28,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:01:28,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:01:28,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:01:28,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:01:28,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:01:28,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:01:28,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:01:28,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:01:28,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:01:28,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:01:28,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:01:28,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:01:28,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:01:28,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:01:28,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:01:28,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:01:28,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:01:28,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:01:28,696 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 -> e75b25accfa51338058ad16425748718d01a5d94bd667d18c22ba63a9d75c3da [2025-03-08 01:01:28,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:01:28,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:01:28,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:01:28,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:01:28,964 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:01:28,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label39.c [2025-03-08 01:01:30,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d668001/7172035b4faa4003afebb1c8fa966079/FLAG870848dda [2025-03-08 01:01:30,472 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:01:30,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label39.c [2025-03-08 01:01:30,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d668001/7172035b4faa4003afebb1c8fa966079/FLAG870848dda [2025-03-08 01:01:30,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d668001/7172035b4faa4003afebb1c8fa966079 [2025-03-08 01:01:30,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:01:30,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:01:30,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:01:30,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:01:30,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:01:30,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:01:30" (1/1) ... [2025-03-08 01:01:30,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352fc76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:30, skipping insertion in model container [2025-03-08 01:01:30,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:01:30" (1/1) ... [2025-03-08 01:01:30,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:01:31,076 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/Problem03_label39.c[54057,54070] [2025-03-08 01:01:31,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:01:31,119 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:01:31,228 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/Problem03_label39.c[54057,54070] [2025-03-08 01:01:31,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:01:31,260 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:01:31,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31 WrapperNode [2025-03-08 01:01:31,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:01:31,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:01:31,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:01:31,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:01:31,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,359 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-08 01:01:31,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:01:31,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:01:31,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:01:31,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:01:31,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:01:31,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:01:31,488 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:01:31,488 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:01:31,488 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:01:31,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (1/1) ... [2025-03-08 01:01:31,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:01:31,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:01:31,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:01:31,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:01:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:01:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:01:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:01:31,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:01:31,616 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:01:31,617 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:01:33,016 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-08 01:01:33,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:01:33,033 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:01:33,033 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:01:33,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:01:33 BoogieIcfgContainer [2025-03-08 01:01:33,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:01:33,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:01:33,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:01:33,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:01:33,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:01:30" (1/3) ... [2025-03-08 01:01:33,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a9138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:01:33, skipping insertion in model container [2025-03-08 01:01:33,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:31" (2/3) ... [2025-03-08 01:01:33,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a9138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:01:33, skipping insertion in model container [2025-03-08 01:01:33,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:01:33" (3/3) ... [2025-03-08 01:01:33,046 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label39.c [2025-03-08 01:01:33,058 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:01:33,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label39.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:01:33,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:01:33,131 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;@75889e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:01:33,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:01:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 01:01:33,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:33,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:33,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:33,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1809334876, now seen corresponding path program 1 times [2025-03-08 01:01:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636871979] [2025-03-08 01:01:33,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:33,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:33,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 01:01:33,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 01:01:33,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:33,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636871979] [2025-03-08 01:01:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636871979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:33,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:01:33,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868787675] [2025-03-08 01:01:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:33,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:33,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:33,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:33,965 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:34,845 INFO L93 Difference]: Finished difference Result 864 states and 1511 transitions. [2025-03-08 01:01:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:34,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-08 01:01:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:34,855 INFO L225 Difference]: With dead ends: 864 [2025-03-08 01:01:34,855 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 01:01:34,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:34,859 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 131 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:34,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 166 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:01:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 01:01:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2025-03-08 01:01:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.6269315673289184) internal successors, (737), 453 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 737 transitions. [2025-03-08 01:01:34,901 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 737 transitions. Word has length 147 [2025-03-08 01:01:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:34,903 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 737 transitions. [2025-03-08 01:01:34,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 737 transitions. [2025-03-08 01:01:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 01:01:34,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:34,910 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 01:01:34,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:01:34,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:34,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash 844333434, now seen corresponding path program 1 times [2025-03-08 01:01:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189646140] [2025-03-08 01:01:34,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:34,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 01:01:34,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 01:01:34,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:34,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:35,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189646140] [2025-03-08 01:01:35,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189646140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:35,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:01:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179680504] [2025-03-08 01:01:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:35,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:35,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:35,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:35,181 INFO L87 Difference]: Start difference. First operand 454 states and 737 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:35,420 INFO L93 Difference]: Finished difference Result 1358 states and 2207 transitions. [2025-03-08 01:01:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:35,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-08 01:01:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:35,424 INFO L225 Difference]: With dead ends: 1358 [2025-03-08 01:01:35,424 INFO L226 Difference]: Without dead ends: 906 [2025-03-08 01:01:35,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:35,426 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:35,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:01:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-08 01:01:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2025-03-08 01:01:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.6223698781838316) internal successors, (1465), 903 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1465 transitions. [2025-03-08 01:01:35,465 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1465 transitions. Word has length 152 [2025-03-08 01:01:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:35,466 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1465 transitions. [2025-03-08 01:01:35,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1465 transitions. [2025-03-08 01:01:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 01:01:35,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:35,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:35,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:01:35,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:35,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1407761461, now seen corresponding path program 1 times [2025-03-08 01:01:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:35,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133929578] [2025-03-08 01:01:35,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:35,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 01:01:35,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 01:01:35,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:35,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:35,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133929578] [2025-03-08 01:01:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133929578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:35,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:01:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696012882] [2025-03-08 01:01:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:35,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:35,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:35,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:35,691 INFO L87 Difference]: Start difference. First operand 904 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:36,353 INFO L93 Difference]: Finished difference Result 2620 states and 4270 transitions. [2025-03-08 01:01:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:36,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-03-08 01:01:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:36,359 INFO L225 Difference]: With dead ends: 2620 [2025-03-08 01:01:36,360 INFO L226 Difference]: Without dead ends: 1718 [2025-03-08 01:01:36,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:36,361 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 217 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:36,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 198 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:01:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-08 01:01:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2025-03-08 01:01:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 1.4041933605125219) internal successors, (2411), 1717 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2411 transitions. [2025-03-08 01:01:36,396 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2411 transitions. Word has length 153 [2025-03-08 01:01:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:36,396 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2411 transitions. [2025-03-08 01:01:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2411 transitions. [2025-03-08 01:01:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 01:01:36,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:36,399 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 01:01:36,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:01:36,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1169018510, now seen corresponding path program 1 times [2025-03-08 01:01:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:36,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789419767] [2025-03-08 01:01:36,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 01:01:36,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 01:01:36,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:36,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:36,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789419767] [2025-03-08 01:01:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789419767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:36,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:36,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:01:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139068030] [2025-03-08 01:01:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:36,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:36,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:36,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:36,555 INFO L87 Difference]: Start difference. First operand 1718 states and 2411 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:37,214 INFO L93 Difference]: Finished difference Result 5089 states and 7163 transitions. [2025-03-08 01:01:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:37,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-08 01:01:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:37,225 INFO L225 Difference]: With dead ends: 5089 [2025-03-08 01:01:37,225 INFO L226 Difference]: Without dead ends: 3373 [2025-03-08 01:01:37,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:37,232 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:37,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:01:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2025-03-08 01:01:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3345. [2025-03-08 01:01:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 3344 states have (on average 1.3785885167464116) internal successors, (4610), 3344 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4610 transitions. [2025-03-08 01:01:37,330 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 4610 transitions. Word has length 155 [2025-03-08 01:01:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:37,330 INFO L471 AbstractCegarLoop]: Abstraction has 3345 states and 4610 transitions. [2025-03-08 01:01:37,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 4610 transitions. [2025-03-08 01:01:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 01:01:37,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:37,334 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 01:01:37,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:01:37,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:37,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1505660712, now seen corresponding path program 1 times [2025-03-08 01:01:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:37,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730822176] [2025-03-08 01:01:37,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:37,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 01:01:37,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 01:01:37,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:37,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:37,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730822176] [2025-03-08 01:01:37,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730822176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:37,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:37,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:01:37,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304931735] [2025-03-08 01:01:37,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:37,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:37,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:37,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:37,574 INFO L87 Difference]: Start difference. First operand 3345 states and 4610 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:38,387 INFO L93 Difference]: Finished difference Result 9981 states and 13760 transitions. [2025-03-08 01:01:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:38,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-03-08 01:01:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:38,407 INFO L225 Difference]: With dead ends: 9981 [2025-03-08 01:01:38,407 INFO L226 Difference]: Without dead ends: 6638 [2025-03-08 01:01:38,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:38,413 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:38,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 98 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:01:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-03-08 01:01:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6633. [2025-03-08 01:01:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 1.3525331724969842) internal successors, (8970), 6632 states have internal predecessors, (8970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 8970 transitions. [2025-03-08 01:01:38,535 INFO L78 Accepts]: Start accepts. Automaton has 6633 states and 8970 transitions. Word has length 159 [2025-03-08 01:01:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:38,535 INFO L471 AbstractCegarLoop]: Abstraction has 6633 states and 8970 transitions. [2025-03-08 01:01:38,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6633 states and 8970 transitions. [2025-03-08 01:01:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 01:01:38,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:38,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:38,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:01:38,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:38,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1357023831, now seen corresponding path program 1 times [2025-03-08 01:01:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970357184] [2025-03-08 01:01:38,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:38,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 01:01:38,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 01:01:38,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:38,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:01:38,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970357184] [2025-03-08 01:01:38,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970357184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:38,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:38,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:38,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012511963] [2025-03-08 01:01:38,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:38,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:38,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:38,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:38,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:38,763 INFO L87 Difference]: Start difference. First operand 6633 states and 8970 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:39,550 INFO L93 Difference]: Finished difference Result 19782 states and 26760 transitions. [2025-03-08 01:01:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 162 [2025-03-08 01:01:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:39,600 INFO L225 Difference]: With dead ends: 19782 [2025-03-08 01:01:39,600 INFO L226 Difference]: Without dead ends: 13151 [2025-03-08 01:01:39,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:39,612 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 118 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:39,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 381 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:01:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-03-08 01:01:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 11517. [2025-03-08 01:01:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.2955019103855505) internal successors, (14919), 11516 states have internal predecessors, (14919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 14919 transitions. [2025-03-08 01:01:39,841 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 14919 transitions. Word has length 162 [2025-03-08 01:01:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:39,841 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 14919 transitions. [2025-03-08 01:01:39,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 14919 transitions. [2025-03-08 01:01:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 01:01:39,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:39,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:39,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:01:39,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:39,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1988037231, now seen corresponding path program 1 times [2025-03-08 01:01:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250330866] [2025-03-08 01:01:39,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:39,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 01:01:39,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 01:01:39,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:39,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:01:40,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:40,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250330866] [2025-03-08 01:01:40,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250330866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:40,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:40,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388945045] [2025-03-08 01:01:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:40,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:40,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:40,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:40,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:40,014 INFO L87 Difference]: Start difference. First operand 11517 states and 14919 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:40,733 INFO L93 Difference]: Finished difference Result 28728 states and 38311 transitions. [2025-03-08 01:01:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:40,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 168 [2025-03-08 01:01:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:40,773 INFO L225 Difference]: With dead ends: 28728 [2025-03-08 01:01:40,773 INFO L226 Difference]: Without dead ends: 17213 [2025-03-08 01:01:40,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:40,788 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 235 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:40,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 404 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:01:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17213 states. [2025-03-08 01:01:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17213 to 15581. [2025-03-08 01:01:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15581 states, 15580 states have (on average 1.2542362002567393) internal successors, (19541), 15580 states have internal predecessors, (19541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15581 states to 15581 states and 19541 transitions. [2025-03-08 01:01:41,055 INFO L78 Accepts]: Start accepts. Automaton has 15581 states and 19541 transitions. Word has length 168 [2025-03-08 01:01:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:41,055 INFO L471 AbstractCegarLoop]: Abstraction has 15581 states and 19541 transitions. [2025-03-08 01:01:41,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 15581 states and 19541 transitions. [2025-03-08 01:01:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-08 01:01:41,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:41,069 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:41,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:01:41,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:41,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1704473861, now seen corresponding path program 1 times [2025-03-08 01:01:41,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:41,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470511067] [2025-03-08 01:01:41,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:41,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-08 01:01:41,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-08 01:01:41,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:41,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 01:01:41,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:41,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470511067] [2025-03-08 01:01:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470511067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:41,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:41,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:41,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215127242] [2025-03-08 01:01:41,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:41,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:01:41,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:41,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:01:41,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:01:41,326 INFO L87 Difference]: Start difference. First operand 15581 states and 19541 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:42,186 INFO L93 Difference]: Finished difference Result 42080 states and 52494 transitions. [2025-03-08 01:01:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:01:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 241 [2025-03-08 01:01:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:42,231 INFO L225 Difference]: With dead ends: 42080 [2025-03-08 01:01:42,232 INFO L226 Difference]: Without dead ends: 26501 [2025-03-08 01:01:42,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:01:42,247 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 545 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:42,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 57 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:01:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26501 states. [2025-03-08 01:01:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26501 to 26497. [2025-03-08 01:01:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26497 states, 26496 states have (on average 1.180480072463768) internal successors, (31278), 26496 states have internal predecessors, (31278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26497 states to 26497 states and 31278 transitions. [2025-03-08 01:01:42,705 INFO L78 Accepts]: Start accepts. Automaton has 26497 states and 31278 transitions. Word has length 241 [2025-03-08 01:01:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 26497 states and 31278 transitions. [2025-03-08 01:01:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26497 states and 31278 transitions. [2025-03-08 01:01:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-08 01:01:42,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:42,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:01:42,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:01:42,724 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1106710987, now seen corresponding path program 1 times [2025-03-08 01:01:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194872310] [2025-03-08 01:01:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:42,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 01:01:42,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 01:01:42,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:42,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:43,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194872310] [2025-03-08 01:01:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194872310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:01:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887914904] [2025-03-08 01:01:43,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:43,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:01:43,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:01:43,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:01:43,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:01:43,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-08 01:01:43,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-08 01:01:43,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:43,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:01:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:01:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 01:01:43,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:01:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887914904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:43,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:01:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:01:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774244781] [2025-03-08 01:01:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:43,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:43,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:43,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:01:43,502 INFO L87 Difference]: Start difference. First operand 26497 states and 31278 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:44,184 INFO L93 Difference]: Finished difference Result 52996 states and 62562 transitions. [2025-03-08 01:01:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 249 [2025-03-08 01:01:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:44,235 INFO L225 Difference]: With dead ends: 52996 [2025-03-08 01:01:44,235 INFO L226 Difference]: Without dead ends: 26501 [2025-03-08 01:01:44,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:01:44,263 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:44,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 109 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:01:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26501 states. [2025-03-08 01:01:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26501 to 24463. [2025-03-08 01:01:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24463 states, 24462 states have (on average 1.1499059766167934) internal successors, (28129), 24462 states have internal predecessors, (28129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24463 states to 24463 states and 28129 transitions. [2025-03-08 01:01:44,631 INFO L78 Accepts]: Start accepts. Automaton has 24463 states and 28129 transitions. Word has length 249 [2025-03-08 01:01:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:44,632 INFO L471 AbstractCegarLoop]: Abstraction has 24463 states and 28129 transitions. [2025-03-08 01:01:44,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 24463 states and 28129 transitions. [2025-03-08 01:01:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-08 01:01:44,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:44,645 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:44,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 01:01:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:01:44,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:44,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1381719861, now seen corresponding path program 1 times [2025-03-08 01:01:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651311944] [2025-03-08 01:01:44,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:44,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-08 01:01:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-08 01:01:44,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:44,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651311944] [2025-03-08 01:01:44,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651311944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:44,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768653508] [2025-03-08 01:01:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:44,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:44,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:44,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:44,992 INFO L87 Difference]: Start difference. First operand 24463 states and 28129 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:45,799 INFO L93 Difference]: Finished difference Result 65984 states and 75645 transitions. [2025-03-08 01:01:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-03-08 01:01:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:45,851 INFO L225 Difference]: With dead ends: 65984 [2025-03-08 01:01:45,851 INFO L226 Difference]: Without dead ends: 41523 [2025-03-08 01:01:45,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:45,875 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 245 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:45,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 333 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:01:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41523 states. [2025-03-08 01:01:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41523 to 39489. [2025-03-08 01:01:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39489 states, 39488 states have (on average 1.11942868719611) internal successors, (44204), 39488 states have internal predecessors, (44204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39489 states to 39489 states and 44204 transitions. [2025-03-08 01:01:46,554 INFO L78 Accepts]: Start accepts. Automaton has 39489 states and 44204 transitions. Word has length 257 [2025-03-08 01:01:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:46,555 INFO L471 AbstractCegarLoop]: Abstraction has 39489 states and 44204 transitions. [2025-03-08 01:01:46,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 39489 states and 44204 transitions. [2025-03-08 01:01:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 01:01:46,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:46,567 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:01:46,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:01:46,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:46,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash -228915034, now seen corresponding path program 1 times [2025-03-08 01:01:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:46,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652241030] [2025-03-08 01:01:46,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:46,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 01:01:46,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 01:01:46,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:46,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:01:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:46,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652241030] [2025-03-08 01:01:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652241030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:46,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:46,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:46,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143332242] [2025-03-08 01:01:46,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:46,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:46,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:46,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:46,792 INFO L87 Difference]: Start difference. First operand 39489 states and 44204 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:47,527 INFO L93 Difference]: Finished difference Result 77770 states and 87120 transitions. [2025-03-08 01:01:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:47,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2025-03-08 01:01:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:47,566 INFO L225 Difference]: With dead ends: 77770 [2025-03-08 01:01:47,566 INFO L226 Difference]: Without dead ends: 38283 [2025-03-08 01:01:47,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:47,594 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 117 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:47,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 291 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:01:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38283 states. [2025-03-08 01:01:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38283 to 35429. [2025-03-08 01:01:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35429 states, 35428 states have (on average 1.1104775883481992) internal successors, (39342), 35428 states have internal predecessors, (39342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35429 states to 35429 states and 39342 transitions. [2025-03-08 01:01:48,027 INFO L78 Accepts]: Start accepts. Automaton has 35429 states and 39342 transitions. Word has length 277 [2025-03-08 01:01:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:48,027 INFO L471 AbstractCegarLoop]: Abstraction has 35429 states and 39342 transitions. [2025-03-08 01:01:48,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 35429 states and 39342 transitions. [2025-03-08 01:01:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 01:01:48,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:48,042 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:48,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:01:48,043 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1247116570, now seen corresponding path program 1 times [2025-03-08 01:01:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000109845] [2025-03-08 01:01:48,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:48,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 01:01:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 01:01:48,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:01:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000109845] [2025-03-08 01:01:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000109845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603502572] [2025-03-08 01:01:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:48,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:48,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:48,413 INFO L87 Difference]: Start difference. First operand 35429 states and 39342 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:49,182 INFO L93 Difference]: Finished difference Result 79410 states and 88152 transitions. [2025-03-08 01:01:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 298 [2025-03-08 01:01:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:49,230 INFO L225 Difference]: With dead ends: 79410 [2025-03-08 01:01:49,230 INFO L226 Difference]: Without dead ends: 43983 [2025-03-08 01:01:49,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:49,254 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 88 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:49,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 344 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:01:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43983 states. [2025-03-08 01:01:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43983 to 40301. [2025-03-08 01:01:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40301 states, 40300 states have (on average 1.1053101736972706) internal successors, (44544), 40300 states have internal predecessors, (44544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40301 states to 40301 states and 44544 transitions. [2025-03-08 01:01:49,874 INFO L78 Accepts]: Start accepts. Automaton has 40301 states and 44544 transitions. Word has length 298 [2025-03-08 01:01:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:49,875 INFO L471 AbstractCegarLoop]: Abstraction has 40301 states and 44544 transitions. [2025-03-08 01:01:49,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40301 states and 44544 transitions. [2025-03-08 01:01:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-08 01:01:49,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:49,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:01:49,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:01:49,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:49,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2003845242, now seen corresponding path program 1 times [2025-03-08 01:01:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:49,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924156413] [2025-03-08 01:01:49,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:49,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-08 01:01:49,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-08 01:01:49,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:49,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:01:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924156413] [2025-03-08 01:01:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924156413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:01:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141204188] [2025-03-08 01:01:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:50,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:01:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:50,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:01:50,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:01:50,157 INFO L87 Difference]: Start difference. First operand 40301 states and 44544 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:51,232 INFO L93 Difference]: Finished difference Result 86328 states and 95538 transitions. [2025-03-08 01:01:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:01:51,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 314 [2025-03-08 01:01:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:51,284 INFO L225 Difference]: With dead ends: 86328 [2025-03-08 01:01:51,284 INFO L226 Difference]: Without dead ends: 46029 [2025-03-08 01:01:51,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:01:51,316 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 310 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:51,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 81 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:01:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46029 states. [2025-03-08 01:01:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46029 to 40301. [2025-03-08 01:01:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40301 states, 40300 states have (on average 1.1053101736972706) internal successors, (44544), 40300 states have internal predecessors, (44544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40301 states to 40301 states and 44544 transitions. [2025-03-08 01:01:51,827 INFO L78 Accepts]: Start accepts. Automaton has 40301 states and 44544 transitions. Word has length 314 [2025-03-08 01:01:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:51,827 INFO L471 AbstractCegarLoop]: Abstraction has 40301 states and 44544 transitions. [2025-03-08 01:01:51,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 40301 states and 44544 transitions. [2025-03-08 01:01:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-08 01:01:51,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:51,902 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:01:51,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:01:51,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 818226687, now seen corresponding path program 1 times [2025-03-08 01:01:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912764118] [2025-03-08 01:01:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:51,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-08 01:01:51,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-08 01:01:51,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:51,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-08 01:01:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912764118] [2025-03-08 01:01:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912764118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:01:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811889159] [2025-03-08 01:01:52,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:52,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:01:52,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:01:52,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:01:52,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:01:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-08 01:01:52,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-08 01:01:52,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:52,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:52,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:01:52,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:01:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 01:01:53,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:01:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811889159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:01:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:01:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262569309] [2025-03-08 01:01:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:53,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:53,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:53,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:01:53,047 INFO L87 Difference]: Start difference. First operand 40301 states and 44544 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:53,740 INFO L93 Difference]: Finished difference Result 83880 states and 92797 transitions. [2025-03-08 01:01:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2025-03-08 01:01:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:53,786 INFO L225 Difference]: With dead ends: 83880 [2025-03-08 01:01:53,786 INFO L226 Difference]: Without dead ends: 43581 [2025-03-08 01:01:53,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:01:53,813 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 77 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:53,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 364 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:01:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43581 states. [2025-03-08 01:01:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43581 to 41113. [2025-03-08 01:01:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41113 states, 41112 states have (on average 1.1022086008951157) internal successors, (45314), 41112 states have internal predecessors, (45314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41113 states to 41113 states and 45314 transitions. [2025-03-08 01:01:54,234 INFO L78 Accepts]: Start accepts. Automaton has 41113 states and 45314 transitions. Word has length 321 [2025-03-08 01:01:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:54,234 INFO L471 AbstractCegarLoop]: Abstraction has 41113 states and 45314 transitions. [2025-03-08 01:01:54,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 41113 states and 45314 transitions. [2025-03-08 01:01:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 01:01:54,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:54,254 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:54,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 01:01:54,454 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,SelfDestructingSolverStorable13 [2025-03-08 01:01:54,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:54,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash -67125045, now seen corresponding path program 1 times [2025-03-08 01:01:54,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933121979] [2025-03-08 01:01:54,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:54,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 01:01:54,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 01:01:54,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:54,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-08 01:01:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933121979] [2025-03-08 01:01:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933121979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:01:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:01:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282870094] [2025-03-08 01:01:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:54,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:54,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:54,648 INFO L87 Difference]: Start difference. First operand 41113 states and 45314 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:55,455 INFO L93 Difference]: Finished difference Result 103000 states and 113765 transitions. [2025-03-08 01:01:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 377 [2025-03-08 01:01:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:55,525 INFO L225 Difference]: With dead ends: 103000 [2025-03-08 01:01:55,526 INFO L226 Difference]: Without dead ends: 61889 [2025-03-08 01:01:55,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:01:55,556 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 206 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:55,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 102 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:01:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61889 states. [2025-03-08 01:01:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61889 to 61067. [2025-03-08 01:01:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61067 states, 61066 states have (on average 1.1058854354305179) internal successors, (67532), 61066 states have internal predecessors, (67532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61067 states to 61067 states and 67532 transitions. [2025-03-08 01:01:56,356 INFO L78 Accepts]: Start accepts. Automaton has 61067 states and 67532 transitions. Word has length 377 [2025-03-08 01:01:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:56,356 INFO L471 AbstractCegarLoop]: Abstraction has 61067 states and 67532 transitions. [2025-03-08 01:01:56,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61067 states and 67532 transitions. [2025-03-08 01:01:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-08 01:01:56,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:56,388 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:01:56,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:01:56,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:01:56,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:01:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash -653705562, now seen corresponding path program 1 times [2025-03-08 01:01:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:01:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321355053] [2025-03-08 01:01:56,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:01:56,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-08 01:01:56,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-08 01:01:56,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:56,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-08 01:01:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:01:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321355053] [2025-03-08 01:01:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321355053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:01:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520014885] [2025-03-08 01:01:56,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:01:56,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:01:56,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:01:56,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:01:56,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 01:01:57,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-08 01:01:57,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-08 01:01:57,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:01:57,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:01:57,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:01:57,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:01:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-08 01:01:57,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:01:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520014885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:01:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:01:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:01:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384899185] [2025-03-08 01:01:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:01:57,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:01:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:01:57,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:01:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:01:57,324 INFO L87 Difference]: Start difference. First operand 61067 states and 67532 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:01:57,924 INFO L93 Difference]: Finished difference Result 173242 states and 191422 transitions. [2025-03-08 01:01:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:01:57,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 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 384 [2025-03-08 01:01:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:01:58,080 INFO L225 Difference]: With dead ends: 173242 [2025-03-08 01:01:58,080 INFO L226 Difference]: Without dead ends: 112177 [2025-03-08 01:01:58,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:01:58,138 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 206 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:01:58,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 549 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 01:01:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112177 states. [2025-03-08 01:01:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112177 to 112175. [2025-03-08 01:01:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112175 states, 112174 states have (on average 1.1038743380819085) internal successors, (123826), 112174 states have internal predecessors, (123826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112175 states to 112175 states and 123826 transitions. [2025-03-08 01:01:59,776 INFO L78 Accepts]: Start accepts. Automaton has 112175 states and 123826 transitions. Word has length 384 [2025-03-08 01:01:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:01:59,776 INFO L471 AbstractCegarLoop]: Abstraction has 112175 states and 123826 transitions. [2025-03-08 01:01:59,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:01:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 112175 states and 123826 transitions. [2025-03-08 01:01:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-08 01:01:59,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:01:59,818 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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] [2025-03-08 01:01:59,825 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-08 01:02:00,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:00,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:00,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1257317572, now seen corresponding path program 1 times [2025-03-08 01:02:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142948120] [2025-03-08 01:02:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:00,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-08 01:02:00,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-08 01:02:00,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:00,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-08 01:02:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:00,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142948120] [2025-03-08 01:02:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142948120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:00,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:00,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092550422] [2025-03-08 01:02:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:00,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:02:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:00,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:02:00,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:00,299 INFO L87 Difference]: Start difference. First operand 112175 states and 123826 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:01,815 INFO L93 Difference]: Finished difference Result 235410 states and 260006 transitions. [2025-03-08 01:02:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:02:01,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 409 [2025-03-08 01:02:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:01,957 INFO L225 Difference]: With dead ends: 235410 [2025-03-08 01:02:01,957 INFO L226 Difference]: Without dead ends: 123237 [2025-03-08 01:02:02,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:02:02,031 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 351 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:02,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 96 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:02:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123237 states. [2025-03-08 01:02:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123237 to 116641. [2025-03-08 01:02:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116641 states, 116640 states have (on average 1.083144718792867) internal successors, (126338), 116640 states have internal predecessors, (126338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116641 states to 116641 states and 126338 transitions. [2025-03-08 01:02:03,784 INFO L78 Accepts]: Start accepts. Automaton has 116641 states and 126338 transitions. Word has length 409 [2025-03-08 01:02:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:03,785 INFO L471 AbstractCegarLoop]: Abstraction has 116641 states and 126338 transitions. [2025-03-08 01:02:03,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 116641 states and 126338 transitions. [2025-03-08 01:02:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 01:02:03,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:03,830 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:03,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:02:03,831 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:03,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1142009930, now seen corresponding path program 1 times [2025-03-08 01:02:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:03,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432029107] [2025-03-08 01:02:03,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:03,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:03,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 01:02:03,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 01:02:03,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:03,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 379 proven. 124 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 01:02:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432029107] [2025-03-08 01:02:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432029107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675558167] [2025-03-08 01:02:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:04,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:04,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:02:04,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:02:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 01:02:04,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 01:02:04,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:04,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:04,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 01:02:04,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 410 proven. 30 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 01:02:05,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:02:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 410 proven. 30 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 01:02:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675558167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:02:05,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:02:05,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 01:02:05,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911593827] [2025-03-08 01:02:05,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:02:05,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 01:02:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:05,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 01:02:05,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:02:05,326 INFO L87 Difference]: Start difference. First operand 116641 states and 126338 transitions. Second operand has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:09,078 INFO L93 Difference]: Finished difference Result 448507 states and 486630 transitions. [2025-03-08 01:02:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 01:02:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 0 states have call successors, (0), 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 436 [2025-03-08 01:02:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:09,522 INFO L225 Difference]: With dead ends: 448507 [2025-03-08 01:02:09,522 INFO L226 Difference]: Without dead ends: 331868 [2025-03-08 01:02:09,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 01:02:09,840 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2777 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:09,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2777 Valid, 182 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [828 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:02:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331868 states. [2025-03-08 01:02:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331868 to 322888. [2025-03-08 01:02:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322888 states, 322887 states have (on average 1.0822702679265501) internal successors, (349451), 322887 states have internal predecessors, (349451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322888 states to 322888 states and 349451 transitions. [2025-03-08 01:02:14,831 INFO L78 Accepts]: Start accepts. Automaton has 322888 states and 349451 transitions. Word has length 436 [2025-03-08 01:02:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:14,831 INFO L471 AbstractCegarLoop]: Abstraction has 322888 states and 349451 transitions. [2025-03-08 01:02:14,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 322888 states and 349451 transitions. [2025-03-08 01:02:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 01:02:14,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:14,866 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:02:14,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 01:02:15,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 01:02:15,067 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1728554641, now seen corresponding path program 1 times [2025-03-08 01:02:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224577550] [2025-03-08 01:02:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:15,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 01:02:15,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 01:02:15,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:15,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-03-08 01:02:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224577550] [2025-03-08 01:02:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224577550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253092907] [2025-03-08 01:02:15,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:15,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:15,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:02:15,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 01:02:15,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 01:02:15,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 01:02:15,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:15,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:15,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:15,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-08 01:02:15,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:15,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253092907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:15,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:15,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:15,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887492958] [2025-03-08 01:02:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:15,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:15,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:15,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:15,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:15,888 INFO L87 Difference]: Start difference. First operand 322888 states and 349451 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:18,289 INFO L93 Difference]: Finished difference Result 631196 states and 683341 transitions. [2025-03-08 01:02:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 444 [2025-03-08 01:02:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:18,756 INFO L225 Difference]: With dead ends: 631196 [2025-03-08 01:02:18,756 INFO L226 Difference]: Without dead ends: 308310 [2025-03-08 01:02:18,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:18,859 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 131 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:18,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 118 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:02:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308310 states. [2025-03-08 01:02:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308310 to 298072. [2025-03-08 01:02:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298072 states, 298071 states have (on average 1.072194208762342) internal successors, (319590), 298071 states have internal predecessors, (319590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298072 states to 298072 states and 319590 transitions. [2025-03-08 01:02:23,523 INFO L78 Accepts]: Start accepts. Automaton has 298072 states and 319590 transitions. Word has length 444 [2025-03-08 01:02:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:23,524 INFO L471 AbstractCegarLoop]: Abstraction has 298072 states and 319590 transitions. [2025-03-08 01:02:23,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 298072 states and 319590 transitions. [2025-03-08 01:02:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 01:02:23,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:23,552 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:02:23,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 01:02:23,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:23,753 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:23,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1831698098, now seen corresponding path program 1 times [2025-03-08 01:02:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774869387] [2025-03-08 01:02:23,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:23,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 01:02:23,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 01:02:23,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:23,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 120 proven. 6 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-08 01:02:24,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:24,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774869387] [2025-03-08 01:02:24,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774869387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:02:24,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445458261] [2025-03-08 01:02:24,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:24,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:24,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:02:24,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:02:24,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 01:02:24,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 01:02:24,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 01:02:24,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:24,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:24,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:02:24,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:02:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 01:02:24,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:02:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445458261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:24,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:02:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 01:02:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097120056] [2025-03-08 01:02:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:24,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:24,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:24,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:24,684 INFO L87 Difference]: Start difference. First operand 298072 states and 319590 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:26,368 INFO L93 Difference]: Finished difference Result 434452 states and 464223 transitions. [2025-03-08 01:02:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:26,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 447 [2025-03-08 01:02:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:26,559 INFO L225 Difference]: With dead ends: 434452 [2025-03-08 01:02:26,559 INFO L226 Difference]: Without dead ends: 127854 [2025-03-08 01:02:26,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:02:26,697 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:26,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:02:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127854 states. [2025-03-08 01:02:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127854 to 109339. [2025-03-08 01:02:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109339 states, 109338 states have (on average 1.0484003731548044) internal successors, (114630), 109338 states have internal predecessors, (114630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109339 states to 109339 states and 114630 transitions. [2025-03-08 01:02:28,572 INFO L78 Accepts]: Start accepts. Automaton has 109339 states and 114630 transitions. Word has length 447 [2025-03-08 01:02:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:02:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 109339 states and 114630 transitions. [2025-03-08 01:02:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 109339 states and 114630 transitions. [2025-03-08 01:02:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 01:02:28,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:02:28,599 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:02:28,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 01:02:28,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:02:28,800 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:02:28,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:02:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1213971145, now seen corresponding path program 1 times [2025-03-08 01:02:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:02:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917744264] [2025-03-08 01:02:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:02:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:02:28,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 01:02:28,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 01:02:28,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:02:28,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:02:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 01:02:29,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:02:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917744264] [2025-03-08 01:02:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917744264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:02:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:02:29,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:02:29,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320104201] [2025-03-08 01:02:29,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:02:29,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:02:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:02:29,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:02:29,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:29,066 INFO L87 Difference]: Start difference. First operand 109339 states and 114630 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:02:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:02:30,145 INFO L93 Difference]: Finished difference Result 221586 states and 232474 transitions. [2025-03-08 01:02:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:02:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 476 [2025-03-08 01:02:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:02:30,281 INFO L225 Difference]: With dead ends: 221586 [2025-03-08 01:02:30,281 INFO L226 Difference]: Without dead ends: 112249 [2025-03-08 01:02:30,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:02:30,354 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 202 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:02:30,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 335 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:02:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112249 states.