./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c55a8c69ce0e8314bfd7e0816f3c45b7211b264f59ab428d293ddf52e857d73b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:49:01,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:49:01,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 16:49:01,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:49:01,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:49:01,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:49:01,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:49:01,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:49:01,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:49:01,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:49:01,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:49:01,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:49:01,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:49:01,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:49:01,843 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:49:01,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:49:01,844 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:49:01,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:49:01,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:49:01,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:49:01,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:49:01,847 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c55a8c69ce0e8314bfd7e0816f3c45b7211b264f59ab428d293ddf52e857d73b [2025-03-03 16:49:02,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:49:02,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:49:02,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:49:02,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:49:02,056 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:49:02,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c [2025-03-03 16:49:03,204 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43636b089/8ee08687c4d046e6abd3c818f527edcc/FLAG12737f2c1 [2025-03-03 16:49:03,540 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:49:03,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c [2025-03-03 16:49:03,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43636b089/8ee08687c4d046e6abd3c818f527edcc/FLAG12737f2c1 [2025-03-03 16:49:03,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43636b089/8ee08687c4d046e6abd3c818f527edcc [2025-03-03 16:49:03,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:49:03,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:49:03,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:49:03,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:49:03,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:49:03,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:49:03" (1/1) ... [2025-03-03 16:49:03,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f03dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:03, skipping insertion in model container [2025-03-03 16:49:03,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:49:03" (1/1) ... [2025-03-03 16:49:03,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:49:03,976 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/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c[1261,1274] [2025-03-03 16:49:04,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:49:04,292 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:49:04,299 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/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c[1261,1274] [2025-03-03 16:49:04,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:49:04,477 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:49:04,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04 WrapperNode [2025-03-03 16:49:04,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:49:04,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:49:04,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:49:04,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:49:04,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:04,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:04,948 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5772 [2025-03-03 16:49:04,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:49:04,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:49:04,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:49:04,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:49:04,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:04,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:49:05,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:49:05,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:49:05,387 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:49:05,387 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:49:05,388 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (1/1) ... [2025-03-03 16:49:05,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:49:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:49:05,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:49:05,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:49:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:49:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:49:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:49:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:49:05,804 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:49:05,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:49:09,703 INFO L? ?]: Removed 3802 outVars from TransFormulas that were not future-live. [2025-03-03 16:49:09,703 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:49:09,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:49:09,863 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:49:09,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:49:09 BoogieIcfgContainer [2025-03-03 16:49:09,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:49:09,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:49:09,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:49:09,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:49:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:49:03" (1/3) ... [2025-03-03 16:49:09,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433eb59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:49:09, skipping insertion in model container [2025-03-03 16:49:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:49:04" (2/3) ... [2025-03-03 16:49:09,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433eb59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:49:09, skipping insertion in model container [2025-03-03 16:49:09,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:49:09" (3/3) ... [2025-03-03 16:49:09,874 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cache_coherence_three.c [2025-03-03 16:49:09,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:49:09,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cache_coherence_three.c that has 1 procedures, 1394 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 16:49:09,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:49:09,954 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;@19f71ecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:49:09,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 16:49:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 1394 states, 1392 states have (on average 1.4992816091954022) internal successors, (2087), 1393 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 16:49:09,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:09,973 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] [2025-03-03 16:49:09,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:09,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash 520461070, now seen corresponding path program 1 times [2025-03-03 16:49:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418125016] [2025-03-03 16:49:09,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:10,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 16:49:10,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 16:49:10,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418125016] [2025-03-03 16:49:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418125016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:49:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631838386] [2025-03-03 16:49:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:10,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:49:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:10,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:49:10,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:10,902 INFO L87 Difference]: Start difference. First operand has 1394 states, 1392 states have (on average 1.4992816091954022) internal successors, (2087), 1393 states have internal predecessors, (2087), 0 states have call successors, (0), 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 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:11,553 INFO L93 Difference]: Finished difference Result 2617 states and 3921 transitions. [2025-03-03 16:49:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:49:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-03 16:49:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:11,572 INFO L225 Difference]: With dead ends: 2617 [2025-03-03 16:49:11,572 INFO L226 Difference]: Without dead ends: 1393 [2025-03-03 16:49:11,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:11,578 INFO L435 NwaCegarLoop]: 1735 mSDtfsCounter, 0 mSDsluCounter, 3465 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5200 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:11,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5200 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:49:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-03 16:49:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2025-03-03 16:49:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.4978448275862069) internal successors, (2085), 1392 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2085 transitions. [2025-03-03 16:49:11,637 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2085 transitions. Word has length 127 [2025-03-03 16:49:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:11,638 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 2085 transitions. [2025-03-03 16:49:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2085 transitions. [2025-03-03 16:49:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 16:49:11,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:11,643 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] [2025-03-03 16:49:11,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:49:11,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:11,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1040894874, now seen corresponding path program 1 times [2025-03-03 16:49:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364345591] [2025-03-03 16:49:11,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:11,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:11,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 16:49:11,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 16:49:11,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:11,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364345591] [2025-03-03 16:49:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364345591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:11,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:49:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987133987] [2025-03-03 16:49:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:11,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:49:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:11,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:49:11,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:11,988 INFO L87 Difference]: Start difference. First operand 1393 states and 2085 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:12,539 INFO L93 Difference]: Finished difference Result 2618 states and 3919 transitions. [2025-03-03 16:49:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:49:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-03 16:49:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:12,545 INFO L225 Difference]: With dead ends: 2618 [2025-03-03 16:49:12,545 INFO L226 Difference]: Without dead ends: 1395 [2025-03-03 16:49:12,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:12,548 INFO L435 NwaCegarLoop]: 1735 mSDtfsCounter, 0 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5197 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:12,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5197 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:49:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-03 16:49:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2025-03-03 16:49:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1394 states have (on average 1.4971305595408895) internal successors, (2087), 1394 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2087 transitions. [2025-03-03 16:49:12,576 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2087 transitions. Word has length 128 [2025-03-03 16:49:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:12,577 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 2087 transitions. [2025-03-03 16:49:12,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2087 transitions. [2025-03-03 16:49:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 16:49:12,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:12,580 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] [2025-03-03 16:49:12,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:49:12,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash -271458807, now seen corresponding path program 1 times [2025-03-03 16:49:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:12,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138437126] [2025-03-03 16:49:12,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:12,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 16:49:12,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 16:49:12,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:12,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138437126] [2025-03-03 16:49:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138437126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:13,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:49:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733663277] [2025-03-03 16:49:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:13,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:49:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:13,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:49:13,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:49:13,107 INFO L87 Difference]: Start difference. First operand 1395 states and 2087 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:13,928 INFO L93 Difference]: Finished difference Result 2624 states and 3926 transitions. [2025-03-03 16:49:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:13,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-03 16:49:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:13,933 INFO L225 Difference]: With dead ends: 2624 [2025-03-03 16:49:13,933 INFO L226 Difference]: Without dead ends: 1399 [2025-03-03 16:49:13,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:13,935 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 1968 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 5130 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:13,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1968 Valid, 5130 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:49:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-03 16:49:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1398. [2025-03-03 16:49:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1397 states have (on average 1.4960629921259843) internal successors, (2090), 1397 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2090 transitions. [2025-03-03 16:49:13,957 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2090 transitions. Word has length 129 [2025-03-03 16:49:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:13,958 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2090 transitions. [2025-03-03 16:49:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2090 transitions. [2025-03-03 16:49:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 16:49:13,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:13,960 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] [2025-03-03 16:49:13,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:49:13,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:13,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1168031766, now seen corresponding path program 1 times [2025-03-03 16:49:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:13,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318901165] [2025-03-03 16:49:13,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:13,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:14,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 16:49:14,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 16:49:14,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:14,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318901165] [2025-03-03 16:49:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318901165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:14,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:14,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:49:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119263763] [2025-03-03 16:49:14,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:14,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:49:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:14,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:49:14,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:14,541 INFO L87 Difference]: Start difference. First operand 1398 states and 2090 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:15,140 INFO L93 Difference]: Finished difference Result 2626 states and 3926 transitions. [2025-03-03 16:49:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:49:15,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-03 16:49:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:15,146 INFO L225 Difference]: With dead ends: 2626 [2025-03-03 16:49:15,146 INFO L226 Difference]: Without dead ends: 1398 [2025-03-03 16:49:15,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:15,148 INFO L435 NwaCegarLoop]: 1732 mSDtfsCounter, 6 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5187 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:15,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5187 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:49:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-03 16:49:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2025-03-03 16:49:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1397 states have (on average 1.495347172512527) internal successors, (2089), 1397 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2089 transitions. [2025-03-03 16:49:15,224 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2089 transitions. Word has length 130 [2025-03-03 16:49:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:15,224 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2089 transitions. [2025-03-03 16:49:15,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2089 transitions. [2025-03-03 16:49:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 16:49:15,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:15,226 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] [2025-03-03 16:49:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:49:15,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:15,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash 4854082, now seen corresponding path program 1 times [2025-03-03 16:49:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035603033] [2025-03-03 16:49:15,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:15,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 16:49:15,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 16:49:15,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:15,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035603033] [2025-03-03 16:49:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035603033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:16,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:16,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:49:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682569245] [2025-03-03 16:49:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:16,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:49:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:16,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:49:16,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:16,208 INFO L87 Difference]: Start difference. First operand 1398 states and 2089 transitions. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:17,189 INFO L93 Difference]: Finished difference Result 2635 states and 3937 transitions. [2025-03-03 16:49:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:49:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-03 16:49:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:17,195 INFO L225 Difference]: With dead ends: 2635 [2025-03-03 16:49:17,195 INFO L226 Difference]: Without dead ends: 1407 [2025-03-03 16:49:17,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:49:17,197 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 2001 mSDsluCounter, 6761 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 8453 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:17,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2001 Valid, 8453 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:49:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-03 16:49:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1402. [2025-03-03 16:49:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.4946466809421841) internal successors, (2094), 1401 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2094 transitions. [2025-03-03 16:49:17,219 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2094 transitions. Word has length 131 [2025-03-03 16:49:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:17,219 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2094 transitions. [2025-03-03 16:49:17,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2094 transitions. [2025-03-03 16:49:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 16:49:17,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:17,220 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] [2025-03-03 16:49:17,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:49:17,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:17,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash -466026769, now seen corresponding path program 1 times [2025-03-03 16:49:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548316409] [2025-03-03 16:49:17,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:17,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 16:49:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 16:49:17,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:17,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548316409] [2025-03-03 16:49:17,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548316409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:17,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:17,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:49:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726336290] [2025-03-03 16:49:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:17,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:49:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:17,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:49:17,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:17,635 INFO L87 Difference]: Start difference. First operand 1402 states and 2094 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:18,243 INFO L93 Difference]: Finished difference Result 2634 states and 3934 transitions. [2025-03-03 16:49:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:49:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-03 16:49:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:18,247 INFO L225 Difference]: With dead ends: 2634 [2025-03-03 16:49:18,247 INFO L226 Difference]: Without dead ends: 1402 [2025-03-03 16:49:18,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:18,249 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 6 mSDsluCounter, 3453 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5184 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:18,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5184 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:49:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-03 16:49:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2025-03-03 16:49:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.4939329050678087) internal successors, (2093), 1401 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2093 transitions. [2025-03-03 16:49:18,271 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2093 transitions. Word has length 132 [2025-03-03 16:49:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:18,271 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2093 transitions. [2025-03-03 16:49:18,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2093 transitions. [2025-03-03 16:49:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 16:49:18,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:18,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:49:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:49:18,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:18,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1172937590, now seen corresponding path program 1 times [2025-03-03 16:49:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968688050] [2025-03-03 16:49:18,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:18,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 16:49:18,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 16:49:18,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:19,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:19,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968688050] [2025-03-03 16:49:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968688050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:19,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:49:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046615586] [2025-03-03 16:49:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:19,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:49:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:19,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:49:19,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:49:19,053 INFO L87 Difference]: Start difference. First operand 1402 states and 2093 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:21,707 INFO L93 Difference]: Finished difference Result 3682 states and 5497 transitions. [2025-03-03 16:49:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:49:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-03 16:49:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:21,714 INFO L225 Difference]: With dead ends: 3682 [2025-03-03 16:49:21,714 INFO L226 Difference]: Without dead ends: 2450 [2025-03-03 16:49:21,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:49:21,717 INFO L435 NwaCegarLoop]: 2513 mSDtfsCounter, 3558 mSDsluCounter, 5478 mSDsCounter, 0 mSdLazyCounter, 4964 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3558 SdHoareTripleChecker+Valid, 7991 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:21,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3558 Valid, 7991 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4964 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 16:49:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2025-03-03 16:49:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 1412. [2025-03-03 16:49:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.4932671863926292) internal successors, (2107), 1411 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2107 transitions. [2025-03-03 16:49:21,743 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2107 transitions. Word has length 133 [2025-03-03 16:49:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:21,743 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2107 transitions. [2025-03-03 16:49:21,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2107 transitions. [2025-03-03 16:49:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 16:49:21,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:21,744 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] [2025-03-03 16:49:21,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:49:21,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:21,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -153685295, now seen corresponding path program 1 times [2025-03-03 16:49:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:21,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106090408] [2025-03-03 16:49:21,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:21,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 16:49:21,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 16:49:21,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:21,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106090408] [2025-03-03 16:49:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106090408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:49:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750981440] [2025-03-03 16:49:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:22,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:49:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:22,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:49:22,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:22,154 INFO L87 Difference]: Start difference. First operand 1412 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:22,706 INFO L93 Difference]: Finished difference Result 2654 states and 3960 transitions. [2025-03-03 16:49:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:49:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-03 16:49:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:22,710 INFO L225 Difference]: With dead ends: 2654 [2025-03-03 16:49:22,710 INFO L226 Difference]: Without dead ends: 1412 [2025-03-03 16:49:22,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:49:22,711 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 6 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5181 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:22,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5181 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:49:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-03-03 16:49:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2025-03-03 16:49:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.492558469170801) internal successors, (2106), 1411 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2106 transitions. [2025-03-03 16:49:22,729 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2106 transitions. Word has length 133 [2025-03-03 16:49:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:22,729 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2106 transitions. [2025-03-03 16:49:22,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2106 transitions. [2025-03-03 16:49:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 16:49:22,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:22,730 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] [2025-03-03 16:49:22,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:49:22,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:22,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1372073934, now seen corresponding path program 1 times [2025-03-03 16:49:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163083523] [2025-03-03 16:49:22,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:22,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:22,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 16:49:22,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 16:49:22,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:22,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:23,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:23,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163083523] [2025-03-03 16:49:23,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163083523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:23,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:23,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:49:23,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98757861] [2025-03-03 16:49:23,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:23,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:49:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:23,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:49:23,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:49:23,712 INFO L87 Difference]: Start difference. First operand 1412 states and 2106 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:24,872 INFO L93 Difference]: Finished difference Result 2662 states and 3970 transitions. [2025-03-03 16:49:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:49:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-03 16:49:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:24,876 INFO L225 Difference]: With dead ends: 2662 [2025-03-03 16:49:24,876 INFO L226 Difference]: Without dead ends: 1420 [2025-03-03 16:49:24,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:49:24,877 INFO L435 NwaCegarLoop]: 1689 mSDtfsCounter, 1971 mSDsluCounter, 10115 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 11804 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:24,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 11804 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:49:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-03-03 16:49:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1417. [2025-03-03 16:49:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 1.4915254237288136) internal successors, (2112), 1416 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2112 transitions. [2025-03-03 16:49:24,895 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2112 transitions. Word has length 134 [2025-03-03 16:49:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:24,895 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 2112 transitions. [2025-03-03 16:49:24,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2112 transitions. [2025-03-03 16:49:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 16:49:24,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:24,897 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] [2025-03-03 16:49:24,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:49:24,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:24,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -735832133, now seen corresponding path program 1 times [2025-03-03 16:49:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:24,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556415240] [2025-03-03 16:49:24,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:24,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 16:49:24,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 16:49:24,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556415240] [2025-03-03 16:49:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556415240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:25,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:49:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645002532] [2025-03-03 16:49:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:49:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:25,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:49:25,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:25,365 INFO L87 Difference]: Start difference. First operand 1417 states and 2112 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:26,337 INFO L93 Difference]: Finished difference Result 2673 states and 3983 transitions. [2025-03-03 16:49:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:49:26,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-03 16:49:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:26,341 INFO L225 Difference]: With dead ends: 2673 [2025-03-03 16:49:26,341 INFO L226 Difference]: Without dead ends: 1426 [2025-03-03 16:49:26,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:49:26,342 INFO L435 NwaCegarLoop]: 1689 mSDtfsCounter, 1992 mSDsluCounter, 8430 mSDsCounter, 0 mSdLazyCounter, 2357 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 10119 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:26,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 10119 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:49:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-03-03 16:49:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1421. [2025-03-03 16:49:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.4908450704225351) internal successors, (2117), 1420 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2117 transitions. [2025-03-03 16:49:26,358 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2117 transitions. Word has length 135 [2025-03-03 16:49:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:26,358 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 2117 transitions. [2025-03-03 16:49:26,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2117 transitions. [2025-03-03 16:49:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 16:49:26,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:26,359 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] [2025-03-03 16:49:26,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:49:26,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:26,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1823499080, now seen corresponding path program 1 times [2025-03-03 16:49:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176877401] [2025-03-03 16:49:26,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:26,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 16:49:26,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 16:49:26,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:26,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:26,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:26,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176877401] [2025-03-03 16:49:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176877401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:26,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:49:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307162343] [2025-03-03 16:49:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:49:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:26,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:49:26,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:26,947 INFO L87 Difference]: Start difference. First operand 1421 states and 2117 transitions. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:27,761 INFO L93 Difference]: Finished difference Result 2707 states and 4029 transitions. [2025-03-03 16:49:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:49:27,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-03 16:49:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:27,765 INFO L225 Difference]: With dead ends: 2707 [2025-03-03 16:49:27,765 INFO L226 Difference]: Without dead ends: 1456 [2025-03-03 16:49:27,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:27,766 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 21 mSDsluCounter, 8672 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10408 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:27,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10408 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:49:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-03-03 16:49:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1452. [2025-03-03 16:49:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.4886285320468642) internal successors, (2160), 1451 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2160 transitions. [2025-03-03 16:49:27,780 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2160 transitions. Word has length 136 [2025-03-03 16:49:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:27,780 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2160 transitions. [2025-03-03 16:49:27,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2160 transitions. [2025-03-03 16:49:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 16:49:27,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:27,783 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] [2025-03-03 16:49:27,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:49:27,783 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:27,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2049932547, now seen corresponding path program 1 times [2025-03-03 16:49:27,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149463469] [2025-03-03 16:49:27,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 16:49:27,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 16:49:27,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:27,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149463469] [2025-03-03 16:49:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149463469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:49:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146929976] [2025-03-03 16:49:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:28,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:49:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:49:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:49:28,087 INFO L87 Difference]: Start difference. First operand 1452 states and 2160 transitions. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:29,873 INFO L93 Difference]: Finished difference Result 3452 states and 5126 transitions. [2025-03-03 16:49:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:49:29,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-03 16:49:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:29,882 INFO L225 Difference]: With dead ends: 3452 [2025-03-03 16:49:29,882 INFO L226 Difference]: Without dead ends: 2170 [2025-03-03 16:49:29,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:49:29,884 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 3938 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3938 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 3886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:29,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3938 Valid, 4433 Invalid, 3886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 16:49:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-03-03 16:49:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1520. [2025-03-03 16:49:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 1.4825543120473996) internal successors, (2252), 1519 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2252 transitions. [2025-03-03 16:49:29,907 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2252 transitions. Word has length 136 [2025-03-03 16:49:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:29,908 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 2252 transitions. [2025-03-03 16:49:29,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2252 transitions. [2025-03-03 16:49:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 16:49:29,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:29,909 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] [2025-03-03 16:49:29,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:49:29,909 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -197879637, now seen corresponding path program 1 times [2025-03-03 16:49:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265190575] [2025-03-03 16:49:29,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:29,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 16:49:30,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 16:49:30,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:30,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265190575] [2025-03-03 16:49:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265190575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:30,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:30,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:49:30,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025244619] [2025-03-03 16:49:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:49:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:30,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:49:30,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:49:30,513 INFO L87 Difference]: Start difference. First operand 1520 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:31,090 INFO L93 Difference]: Finished difference Result 2882 states and 4266 transitions. [2025-03-03 16:49:31,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:31,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-03 16:49:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:31,094 INFO L225 Difference]: With dead ends: 2882 [2025-03-03 16:49:31,094 INFO L226 Difference]: Without dead ends: 1532 [2025-03-03 16:49:31,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:31,095 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 1981 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 5070 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:31,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1981 Valid, 5070 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:49:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-03-03 16:49:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2025-03-03 16:49:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.4787720444154147) internal successors, (2264), 1531 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2264 transitions. [2025-03-03 16:49:31,109 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2264 transitions. Word has length 136 [2025-03-03 16:49:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:31,109 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2264 transitions. [2025-03-03 16:49:31,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2264 transitions. [2025-03-03 16:49:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 16:49:31,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:31,111 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] [2025-03-03 16:49:31,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:49:31,111 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:31,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash -998669045, now seen corresponding path program 1 times [2025-03-03 16:49:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:31,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108109642] [2025-03-03 16:49:31,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:31,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 16:49:31,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 16:49:31,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:31,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:31,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108109642] [2025-03-03 16:49:31,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108109642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:31,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:31,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:49:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183411644] [2025-03-03 16:49:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:31,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:49:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:31,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:49:31,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:49:31,436 INFO L87 Difference]: Start difference. First operand 1532 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:31,937 INFO L93 Difference]: Finished difference Result 2900 states and 4282 transitions. [2025-03-03 16:49:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:31,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-03 16:49:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:31,940 INFO L225 Difference]: With dead ends: 2900 [2025-03-03 16:49:31,940 INFO L226 Difference]: Without dead ends: 1538 [2025-03-03 16:49:31,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:31,942 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 1993 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1993 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:31,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1993 Valid, 5071 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:49:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-03-03 16:49:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2025-03-03 16:49:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 1.4769030579050098) internal successors, (2270), 1537 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2270 transitions. [2025-03-03 16:49:31,963 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2270 transitions. Word has length 136 [2025-03-03 16:49:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:31,963 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 2270 transitions. [2025-03-03 16:49:31,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2270 transitions. [2025-03-03 16:49:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:31,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:31,965 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] [2025-03-03 16:49:31,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:49:31,965 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:31,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:31,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1285961054, now seen corresponding path program 1 times [2025-03-03 16:49:31,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435772715] [2025-03-03 16:49:31,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:31,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:32,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:32,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:32,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:32,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435772715] [2025-03-03 16:49:32,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435772715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:32,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:32,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:49:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885713847] [2025-03-03 16:49:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:32,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:49:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:32,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:49:32,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:49:32,345 INFO L87 Difference]: Start difference. First operand 1538 states and 2270 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:34,798 INFO L93 Difference]: Finished difference Result 3880 states and 5716 transitions. [2025-03-03 16:49:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:49:34,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:34,804 INFO L225 Difference]: With dead ends: 3880 [2025-03-03 16:49:34,804 INFO L226 Difference]: Without dead ends: 2512 [2025-03-03 16:49:34,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:49:34,805 INFO L435 NwaCegarLoop]: 2361 mSDtfsCounter, 3261 mSDsluCounter, 6901 mSDsCounter, 0 mSdLazyCounter, 6210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3261 SdHoareTripleChecker+Valid, 9262 SdHoareTripleChecker+Invalid, 6211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:34,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3261 Valid, 9262 Invalid, 6211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6210 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:49:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2025-03-03 16:49:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1578. [2025-03-03 16:49:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.471147748890298) internal successors, (2320), 1577 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2320 transitions. [2025-03-03 16:49:34,822 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2320 transitions. Word has length 137 [2025-03-03 16:49:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:34,822 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2320 transitions. [2025-03-03 16:49:34,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2320 transitions. [2025-03-03 16:49:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:34,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:34,823 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] [2025-03-03 16:49:34,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:49:34,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:34,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1297195259, now seen corresponding path program 1 times [2025-03-03 16:49:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970255753] [2025-03-03 16:49:34,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:34,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:34,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:34,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:34,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:35,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970255753] [2025-03-03 16:49:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970255753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:35,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 16:49:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814147922] [2025-03-03 16:49:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:35,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 16:49:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:35,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 16:49:35,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:49:35,289 INFO L87 Difference]: Start difference. First operand 1578 states and 2320 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:36,455 INFO L93 Difference]: Finished difference Result 3110 states and 4548 transitions. [2025-03-03 16:49:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 16:49:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:36,458 INFO L225 Difference]: With dead ends: 3110 [2025-03-03 16:49:36,458 INFO L226 Difference]: Without dead ends: 1702 [2025-03-03 16:49:36,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:49:36,460 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 28 mSDsluCounter, 15476 mSDsCounter, 0 mSdLazyCounter, 3622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 17196 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:36,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 17196 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3622 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 16:49:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-03-03 16:49:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1586. [2025-03-03 16:49:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1585 states have (on average 1.4712933753943218) internal successors, (2332), 1585 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2332 transitions. [2025-03-03 16:49:36,472 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2332 transitions. Word has length 137 [2025-03-03 16:49:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:36,472 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 2332 transitions. [2025-03-03 16:49:36,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2332 transitions. [2025-03-03 16:49:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:36,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:36,473 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] [2025-03-03 16:49:36,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:49:36,473 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:36,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:36,474 INFO L85 PathProgramCache]: Analyzing trace with hash 976393320, now seen corresponding path program 1 times [2025-03-03 16:49:36,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:36,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955349835] [2025-03-03 16:49:36,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:36,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:36,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955349835] [2025-03-03 16:49:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955349835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:49:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167905530] [2025-03-03 16:49:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:37,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:49:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:37,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:49:37,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:49:37,089 INFO L87 Difference]: Start difference. First operand 1586 states and 2332 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:39,128 INFO L93 Difference]: Finished difference Result 4088 states and 6020 transitions. [2025-03-03 16:49:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:49:39,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:39,132 INFO L225 Difference]: With dead ends: 4088 [2025-03-03 16:49:39,132 INFO L226 Difference]: Without dead ends: 2672 [2025-03-03 16:49:39,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:49:39,133 INFO L435 NwaCegarLoop]: 2504 mSDtfsCounter, 3551 mSDsluCounter, 5463 mSDsCounter, 0 mSdLazyCounter, 4951 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3551 SdHoareTripleChecker+Valid, 7967 SdHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:39,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3551 Valid, 7967 Invalid, 4952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4951 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 16:49:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2025-03-03 16:49:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1649. [2025-03-03 16:49:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4654126213592233) internal successors, (2415), 1648 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2415 transitions. [2025-03-03 16:49:39,147 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2415 transitions. Word has length 137 [2025-03-03 16:49:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:39,147 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2415 transitions. [2025-03-03 16:49:39,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2415 transitions. [2025-03-03 16:49:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:39,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:39,148 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] [2025-03-03 16:49:39,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:49:39,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1095580896, now seen corresponding path program 1 times [2025-03-03 16:49:39,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556001925] [2025-03-03 16:49:39,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:39,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:39,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:39,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:39,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556001925] [2025-03-03 16:49:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556001925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:39,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:39,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:49:39,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737872522] [2025-03-03 16:49:39,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:39,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:49:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:39,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:49:39,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:39,472 INFO L87 Difference]: Start difference. First operand 1649 states and 2415 transitions. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:40,096 INFO L93 Difference]: Finished difference Result 3160 states and 4620 transitions. [2025-03-03 16:49:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:49:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:40,099 INFO L225 Difference]: With dead ends: 3160 [2025-03-03 16:49:40,099 INFO L226 Difference]: Without dead ends: 1681 [2025-03-03 16:49:40,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:40,100 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 21 mSDsluCounter, 6943 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8673 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:40,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8673 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:49:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-03-03 16:49:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2025-03-03 16:49:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1676 states have (on average 1.4636038186157518) internal successors, (2453), 1676 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2453 transitions. [2025-03-03 16:49:40,112 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2453 transitions. Word has length 137 [2025-03-03 16:49:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:40,113 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2453 transitions. [2025-03-03 16:49:40,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2453 transitions. [2025-03-03 16:49:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:40,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:40,114 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] [2025-03-03 16:49:40,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:49:40,114 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:40,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 31721441, now seen corresponding path program 1 times [2025-03-03 16:49:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:40,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359279251] [2025-03-03 16:49:40,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:40,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:40,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:40,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:40,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359279251] [2025-03-03 16:49:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359279251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 16:49:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415613900] [2025-03-03 16:49:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:40,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 16:49:40,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:40,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 16:49:40,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:49:40,833 INFO L87 Difference]: Start difference. First operand 1677 states and 2453 transitions. Second operand has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:42,765 INFO L93 Difference]: Finished difference Result 3282 states and 4780 transitions. [2025-03-03 16:49:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 16:49:42,765 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:42,768 INFO L225 Difference]: With dead ends: 3282 [2025-03-03 16:49:42,768 INFO L226 Difference]: Without dead ends: 1775 [2025-03-03 16:49:42,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:49:42,769 INFO L435 NwaCegarLoop]: 1680 mSDtfsCounter, 2119 mSDsluCounter, 23486 mSDsCounter, 0 mSdLazyCounter, 6118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 25166 SdHoareTripleChecker+Invalid, 6119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:42,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 25166 Invalid, 6119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6118 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 16:49:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2025-03-03 16:49:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1770. [2025-03-03 16:49:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 1.455624646693047) internal successors, (2575), 1769 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2575 transitions. [2025-03-03 16:49:42,782 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2575 transitions. Word has length 137 [2025-03-03 16:49:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:42,782 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2575 transitions. [2025-03-03 16:49:42,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 17 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2575 transitions. [2025-03-03 16:49:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:42,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:42,783 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] [2025-03-03 16:49:42,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:49:42,784 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:42,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1345858011, now seen corresponding path program 1 times [2025-03-03 16:49:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809597812] [2025-03-03 16:49:42,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:42,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:42,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:42,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:42,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809597812] [2025-03-03 16:49:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809597812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:49:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766649964] [2025-03-03 16:49:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:43,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:49:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:43,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:49:43,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:49:43,155 INFO L87 Difference]: Start difference. First operand 1770 states and 2575 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:45,050 INFO L93 Difference]: Finished difference Result 4451 states and 6465 transitions. [2025-03-03 16:49:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:49:45,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:45,054 INFO L225 Difference]: With dead ends: 4451 [2025-03-03 16:49:45,054 INFO L226 Difference]: Without dead ends: 2851 [2025-03-03 16:49:45,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:49:45,057 INFO L435 NwaCegarLoop]: 1324 mSDtfsCounter, 4506 mSDsluCounter, 3453 mSDsCounter, 0 mSdLazyCounter, 3540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4506 SdHoareTripleChecker+Valid, 4777 SdHoareTripleChecker+Invalid, 3540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:45,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4506 Valid, 4777 Invalid, 3540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3540 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 16:49:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-03-03 16:49:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2015. [2025-03-03 16:49:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2014 states have (on average 1.4404170804369414) internal successors, (2901), 2014 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2901 transitions. [2025-03-03 16:49:45,071 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2901 transitions. Word has length 137 [2025-03-03 16:49:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:45,071 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2901 transitions. [2025-03-03 16:49:45,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2901 transitions. [2025-03-03 16:49:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:45,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:45,072 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] [2025-03-03 16:49:45,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:49:45,072 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:45,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash 156046830, now seen corresponding path program 1 times [2025-03-03 16:49:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989943707] [2025-03-03 16:49:45,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:45,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:45,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:45,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:45,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989943707] [2025-03-03 16:49:45,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989943707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:45,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:45,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:49:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290276217] [2025-03-03 16:49:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:49:45,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:45,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:49:45,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:49:45,375 INFO L87 Difference]: Start difference. First operand 2015 states and 2901 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:45,854 INFO L93 Difference]: Finished difference Result 3878 states and 5572 transitions. [2025-03-03 16:49:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:45,857 INFO L225 Difference]: With dead ends: 3878 [2025-03-03 16:49:45,857 INFO L226 Difference]: Without dead ends: 2033 [2025-03-03 16:49:45,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:45,859 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 1966 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 5070 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:45,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 5070 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:49:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2025-03-03 16:49:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2033. [2025-03-03 16:49:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 2032 states have (on average 1.436515748031496) internal successors, (2919), 2032 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2919 transitions. [2025-03-03 16:49:45,875 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2919 transitions. Word has length 137 [2025-03-03 16:49:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 2033 states and 2919 transitions. [2025-03-03 16:49:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2919 transitions. [2025-03-03 16:49:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:45,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:45,876 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] [2025-03-03 16:49:45,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:49:45,876 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash 990291498, now seen corresponding path program 1 times [2025-03-03 16:49:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723613838] [2025-03-03 16:49:45,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:45,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:45,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:45,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:45,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:46,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:46,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723613838] [2025-03-03 16:49:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723613838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:46,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:49:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735136370] [2025-03-03 16:49:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:46,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:49:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:46,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:49:46,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:49:46,217 INFO L87 Difference]: Start difference. First operand 2033 states and 2919 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:46,714 INFO L93 Difference]: Finished difference Result 3916 states and 5620 transitions. [2025-03-03 16:49:46,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:46,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:46,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:46,720 INFO L225 Difference]: With dead ends: 3916 [2025-03-03 16:49:46,721 INFO L226 Difference]: Without dead ends: 2053 [2025-03-03 16:49:46,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:46,727 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 1977 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1977 SdHoareTripleChecker+Valid, 5067 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:46,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1977 Valid, 5067 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:49:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2025-03-03 16:49:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2025-03-03 16:49:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.4342105263157894) internal successors, (2943), 2052 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2943 transitions. [2025-03-03 16:49:46,750 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2943 transitions. Word has length 137 [2025-03-03 16:49:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:46,751 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2943 transitions. [2025-03-03 16:49:46,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2943 transitions. [2025-03-03 16:49:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:46,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:46,753 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] [2025-03-03 16:49:46,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:49:46,753 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:46,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2074003011, now seen corresponding path program 1 times [2025-03-03 16:49:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55336281] [2025-03-03 16:49:46,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:46,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:46,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:46,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:46,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55336281] [2025-03-03 16:49:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55336281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:47,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:47,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:49:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436182136] [2025-03-03 16:49:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:47,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:49:47,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:47,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:49:47,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:49:47,157 INFO L87 Difference]: Start difference. First operand 2053 states and 2943 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:49,056 INFO L93 Difference]: Finished difference Result 5076 states and 7313 transitions. [2025-03-03 16:49:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:49:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:49,061 INFO L225 Difference]: With dead ends: 5076 [2025-03-03 16:49:49,061 INFO L226 Difference]: Without dead ends: 3193 [2025-03-03 16:49:49,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:49:49,064 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 5075 mSDsluCounter, 3404 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5075 SdHoareTripleChecker+Valid, 4672 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:49,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5075 Valid, 4672 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 16:49:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2025-03-03 16:49:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2053. [2025-03-03 16:49:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.4298245614035088) internal successors, (2934), 2052 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2934 transitions. [2025-03-03 16:49:49,080 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2934 transitions. Word has length 137 [2025-03-03 16:49:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:49,080 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2934 transitions. [2025-03-03 16:49:49,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2934 transitions. [2025-03-03 16:49:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:49,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:49,082 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] [2025-03-03 16:49:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:49:49,082 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash -438847672, now seen corresponding path program 1 times [2025-03-03 16:49:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:49,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010576687] [2025-03-03 16:49:49,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:49,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:49,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:49,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:49,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010576687] [2025-03-03 16:49:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010576687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:49:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442059355] [2025-03-03 16:49:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:49,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:49:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:49,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:49:49,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:49:49,399 INFO L87 Difference]: Start difference. First operand 2053 states and 2934 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:49,916 INFO L93 Difference]: Finished difference Result 3884 states and 5548 transitions. [2025-03-03 16:49:49,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:49,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:49,919 INFO L225 Difference]: With dead ends: 3884 [2025-03-03 16:49:49,919 INFO L226 Difference]: Without dead ends: 2001 [2025-03-03 16:49:49,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:49,920 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 1988 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 5069 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:49,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 5069 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:49:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2025-03-03 16:49:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2025-03-03 16:49:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 2000 states have (on average 1.4315) internal successors, (2863), 2000 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2863 transitions. [2025-03-03 16:49:49,932 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2863 transitions. Word has length 137 [2025-03-03 16:49:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:49,933 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 2863 transitions. [2025-03-03 16:49:49,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2863 transitions. [2025-03-03 16:49:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 16:49:49,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:49,934 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] [2025-03-03 16:49:49,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:49:49,934 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:49,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2114984849, now seen corresponding path program 1 times [2025-03-03 16:49:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865142023] [2025-03-03 16:49:49,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:49,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 16:49:50,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 16:49:50,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:50,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:50,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865142023] [2025-03-03 16:49:50,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865142023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:50,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:50,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 16:49:50,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451165048] [2025-03-03 16:49:50,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:50,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 16:49:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:50,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 16:49:50,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:49:50,545 INFO L87 Difference]: Start difference. First operand 2001 states and 2863 transitions. Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:52,132 INFO L93 Difference]: Finished difference Result 4026 states and 5716 transitions. [2025-03-03 16:49:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 16:49:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-03 16:49:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:52,135 INFO L225 Difference]: With dead ends: 4026 [2025-03-03 16:49:52,135 INFO L226 Difference]: Without dead ends: 2195 [2025-03-03 16:49:52,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:49:52,138 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 2064 mSDsluCounter, 16899 mSDsCounter, 0 mSdLazyCounter, 4467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 18591 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:52,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 18591 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4467 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 16:49:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2025-03-03 16:49:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2032. [2025-03-03 16:49:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 1.430329886755293) internal successors, (2905), 2031 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2905 transitions. [2025-03-03 16:49:52,154 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2905 transitions. Word has length 137 [2025-03-03 16:49:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:52,154 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 2905 transitions. [2025-03-03 16:49:52,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2905 transitions. [2025-03-03 16:49:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:49:52,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:52,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] [2025-03-03 16:49:52,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:49:52,156 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:52,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash 775041093, now seen corresponding path program 1 times [2025-03-03 16:49:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:52,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450355765] [2025-03-03 16:49:52,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:52,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:49:52,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:49:52,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:52,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450355765] [2025-03-03 16:49:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450355765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:52,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:49:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482606578] [2025-03-03 16:49:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:49:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:52,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:49:52,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:49:52,613 INFO L87 Difference]: Start difference. First operand 2032 states and 2905 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:54,528 INFO L93 Difference]: Finished difference Result 4721 states and 6787 transitions. [2025-03-03 16:49:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:49:54,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:49:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:54,531 INFO L225 Difference]: With dead ends: 4721 [2025-03-03 16:49:54,531 INFO L226 Difference]: Without dead ends: 2859 [2025-03-03 16:49:54,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:49:54,533 INFO L435 NwaCegarLoop]: 2348 mSDtfsCounter, 3254 mSDsluCounter, 5140 mSDsCounter, 0 mSdLazyCounter, 4584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3254 SdHoareTripleChecker+Valid, 7488 SdHoareTripleChecker+Invalid, 4585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:54,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3254 Valid, 7488 Invalid, 4585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4584 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 16:49:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2025-03-03 16:49:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2026. [2025-03-03 16:49:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2025 states have (on average 1.428641975308642) internal successors, (2893), 2025 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2893 transitions. [2025-03-03 16:49:54,549 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2893 transitions. Word has length 138 [2025-03-03 16:49:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:54,549 INFO L471 AbstractCegarLoop]: Abstraction has 2026 states and 2893 transitions. [2025-03-03 16:49:54,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2893 transitions. [2025-03-03 16:49:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:49:54,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:54,551 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] [2025-03-03 16:49:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 16:49:54,551 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:54,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1025318208, now seen corresponding path program 1 times [2025-03-03 16:49:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940047333] [2025-03-03 16:49:54,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:54,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:49:54,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:49:54,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:54,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:54,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940047333] [2025-03-03 16:49:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940047333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:49:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705807555] [2025-03-03 16:49:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:49:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:54,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:49:54,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:54,950 INFO L87 Difference]: Start difference. First operand 2026 states and 2893 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:56,193 INFO L93 Difference]: Finished difference Result 5129 states and 7335 transitions. [2025-03-03 16:49:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:49:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:56,197 INFO L225 Difference]: With dead ends: 5129 [2025-03-03 16:49:56,197 INFO L226 Difference]: Without dead ends: 3273 [2025-03-03 16:49:56,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:56,199 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 4886 mSDsluCounter, 4381 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4886 SdHoareTripleChecker+Valid, 6050 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:56,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4886 Valid, 6050 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 16:49:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2025-03-03 16:49:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2034. [2025-03-03 16:49:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 2033 states have (on average 1.427939006394491) internal successors, (2903), 2033 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2903 transitions. [2025-03-03 16:49:56,215 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2903 transitions. Word has length 138 [2025-03-03 16:49:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:56,215 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2903 transitions. [2025-03-03 16:49:56,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2903 transitions. [2025-03-03 16:49:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:49:56,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:56,216 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] [2025-03-03 16:49:56,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 16:49:56,216 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:56,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1621229701, now seen corresponding path program 1 times [2025-03-03 16:49:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557484465] [2025-03-03 16:49:56,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:56,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:49:56,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:49:56,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:56,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557484465] [2025-03-03 16:49:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557484465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:56,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:56,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:49:56,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81110645] [2025-03-03 16:49:56,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:56,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:49:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:56,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:49:56,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:49:56,640 INFO L87 Difference]: Start difference. First operand 2034 states and 2903 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:49:57,373 INFO L93 Difference]: Finished difference Result 5191 states and 7448 transitions. [2025-03-03 16:49:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:49:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:49:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:49:57,376 INFO L225 Difference]: With dead ends: 5191 [2025-03-03 16:49:57,376 INFO L226 Difference]: Without dead ends: 3335 [2025-03-03 16:49:57,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:49:57,379 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 5453 mSDsluCounter, 3333 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5453 SdHoareTripleChecker+Valid, 5002 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:49:57,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5453 Valid, 5002 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:49:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-03-03 16:49:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2044. [2025-03-03 16:49:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2043 states have (on average 1.4258443465491923) internal successors, (2913), 2043 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2913 transitions. [2025-03-03 16:49:57,396 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2913 transitions. Word has length 138 [2025-03-03 16:49:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:49:57,396 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2913 transitions. [2025-03-03 16:49:57,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:49:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2913 transitions. [2025-03-03 16:49:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:49:57,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:49:57,397 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] [2025-03-03 16:49:57,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 16:49:57,398 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:49:57,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:49:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1106803740, now seen corresponding path program 1 times [2025-03-03 16:49:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:49:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650932124] [2025-03-03 16:49:57,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:49:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:49:57,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:49:57,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:49:57,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:49:57,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:49:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:49:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:49:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650932124] [2025-03-03 16:49:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650932124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:49:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:49:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 16:49:58,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802722406] [2025-03-03 16:49:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:49:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 16:49:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:49:58,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 16:49:58,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:49:58,278 INFO L87 Difference]: Start difference. First operand 2044 states and 2913 transitions. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:00,352 INFO L93 Difference]: Finished difference Result 3936 states and 5594 transitions. [2025-03-03 16:50:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 16:50:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:50:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:00,354 INFO L225 Difference]: With dead ends: 3936 [2025-03-03 16:50:00,354 INFO L226 Difference]: Without dead ends: 2080 [2025-03-03 16:50:00,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-03-03 16:50:00,356 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 2093 mSDsluCounter, 25188 mSDsCounter, 0 mSdLazyCounter, 6442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 26869 SdHoareTripleChecker+Invalid, 6443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:00,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 26869 Invalid, 6443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6442 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 16:50:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-03-03 16:50:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2077. [2025-03-03 16:50:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 2076 states have (on average 1.4210019267822736) internal successors, (2950), 2076 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 2950 transitions. [2025-03-03 16:50:00,368 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 2950 transitions. Word has length 138 [2025-03-03 16:50:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:00,368 INFO L471 AbstractCegarLoop]: Abstraction has 2077 states and 2950 transitions. [2025-03-03 16:50:00,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2950 transitions. [2025-03-03 16:50:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:50:00,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:00,369 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] [2025-03-03 16:50:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 16:50:00,369 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:00,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 176455200, now seen corresponding path program 1 times [2025-03-03 16:50:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383729362] [2025-03-03 16:50:00,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:00,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:50:00,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:50:00,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:00,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383729362] [2025-03-03 16:50:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383729362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:50:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774755629] [2025-03-03 16:50:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:00,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:50:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:00,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:50:00,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:50:00,644 INFO L87 Difference]: Start difference. First operand 2077 states and 2950 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:02,293 INFO L93 Difference]: Finished difference Result 4673 states and 6656 transitions. [2025-03-03 16:50:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:50:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:50:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:02,296 INFO L225 Difference]: With dead ends: 4673 [2025-03-03 16:50:02,296 INFO L226 Difference]: Without dead ends: 2784 [2025-03-03 16:50:02,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:50:02,300 INFO L435 NwaCegarLoop]: 1111 mSDtfsCounter, 3912 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3912 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 3886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:02,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3912 Valid, 4436 Invalid, 3886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 16:50:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-03-03 16:50:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2135. [2025-03-03 16:50:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2135 states, 2134 states have (on average 1.414714151827554) internal successors, (3019), 2134 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 3019 transitions. [2025-03-03 16:50:02,323 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 3019 transitions. Word has length 138 [2025-03-03 16:50:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:02,323 INFO L471 AbstractCegarLoop]: Abstraction has 2135 states and 3019 transitions. [2025-03-03 16:50:02,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 3019 transitions. [2025-03-03 16:50:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:50:02,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:02,324 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] [2025-03-03 16:50:02,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 16:50:02,324 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:02,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2103153661, now seen corresponding path program 1 times [2025-03-03 16:50:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143812406] [2025-03-03 16:50:02,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:02,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:50:02,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:50:02,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:02,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143812406] [2025-03-03 16:50:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143812406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:03,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 16:50:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836518334] [2025-03-03 16:50:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 16:50:03,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:03,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 16:50:03,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:50:03,428 INFO L87 Difference]: Start difference. First operand 2135 states and 3019 transitions. Second operand has 23 states, 23 states have (on average 6.0) internal successors, (138), 23 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:06,274 INFO L93 Difference]: Finished difference Result 4115 states and 5803 transitions. [2025-03-03 16:50:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 16:50:06,274 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.0) internal successors, (138), 23 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:50:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:06,276 INFO L225 Difference]: With dead ends: 4115 [2025-03-03 16:50:06,276 INFO L226 Difference]: Without dead ends: 2168 [2025-03-03 16:50:06,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:50:06,278 INFO L435 NwaCegarLoop]: 1674 mSDtfsCounter, 2067 mSDsluCounter, 33438 mSDsCounter, 0 mSdLazyCounter, 8607 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 35112 SdHoareTripleChecker+Invalid, 8609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:06,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 35112 Invalid, 8609 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 8607 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 16:50:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2025-03-03 16:50:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2163. [2025-03-03 16:50:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.4116558741905643) internal successors, (3052), 2162 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3052 transitions. [2025-03-03 16:50:06,293 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3052 transitions. Word has length 138 [2025-03-03 16:50:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 3052 transitions. [2025-03-03 16:50:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.0) internal successors, (138), 23 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3052 transitions. [2025-03-03 16:50:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:50:06,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:06,294 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] [2025-03-03 16:50:06,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 16:50:06,294 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:06,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash 624416342, now seen corresponding path program 1 times [2025-03-03 16:50:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121348536] [2025-03-03 16:50:06,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:06,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:50:06,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:50:06,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121348536] [2025-03-03 16:50:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121348536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:06,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:06,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 16:50:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539160849] [2025-03-03 16:50:06,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:06,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 16:50:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:06,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 16:50:06,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:50:06,725 INFO L87 Difference]: Start difference. First operand 2163 states and 3052 transitions. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:08,090 INFO L93 Difference]: Finished difference Result 4158 states and 5857 transitions. [2025-03-03 16:50:08,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:50:08,090 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:50:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:08,092 INFO L225 Difference]: With dead ends: 4158 [2025-03-03 16:50:08,092 INFO L226 Difference]: Without dead ends: 2183 [2025-03-03 16:50:08,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:50:08,093 INFO L435 NwaCegarLoop]: 1724 mSDtfsCounter, 30 mSDsluCounter, 18939 mSDsCounter, 0 mSdLazyCounter, 4376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 20663 SdHoareTripleChecker+Invalid, 4377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:08,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 20663 Invalid, 4377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4376 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:50:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2025-03-03 16:50:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2168. [2025-03-03 16:50:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2167 states have (on average 1.4111675126903553) internal successors, (3058), 2167 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3058 transitions. [2025-03-03 16:50:08,110 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3058 transitions. Word has length 138 [2025-03-03 16:50:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 3058 transitions. [2025-03-03 16:50:08,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3058 transitions. [2025-03-03 16:50:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:50:08,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:08,111 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] [2025-03-03 16:50:08,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 16:50:08,111 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:08,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2073343684, now seen corresponding path program 1 times [2025-03-03 16:50:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738143141] [2025-03-03 16:50:08,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:08,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:50:08,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:50:08,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:08,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738143141] [2025-03-03 16:50:08,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738143141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:08,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:08,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:50:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561539210] [2025-03-03 16:50:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:08,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:50:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:08,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:50:08,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:50:08,437 INFO L87 Difference]: Start difference. First operand 2168 states and 3058 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:10,189 INFO L93 Difference]: Finished difference Result 5203 states and 7409 transitions. [2025-03-03 16:50:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:50:10,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:50:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:10,192 INFO L225 Difference]: With dead ends: 5203 [2025-03-03 16:50:10,192 INFO L226 Difference]: Without dead ends: 3223 [2025-03-03 16:50:10,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:50:10,194 INFO L435 NwaCegarLoop]: 1256 mSDtfsCounter, 5078 mSDsluCounter, 3388 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5078 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 3674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:10,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5078 Valid, 4644 Invalid, 3674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 16:50:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2025-03-03 16:50:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2084. [2025-03-03 16:50:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2083 states have (on average 1.413346135381661) internal successors, (2944), 2083 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2944 transitions. [2025-03-03 16:50:10,211 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2944 transitions. Word has length 138 [2025-03-03 16:50:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:10,212 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 2944 transitions. [2025-03-03 16:50:10,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2944 transitions. [2025-03-03 16:50:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 16:50:10,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:10,212 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] [2025-03-03 16:50:10,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 16:50:10,213 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1793061752, now seen corresponding path program 1 times [2025-03-03 16:50:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134780864] [2025-03-03 16:50:10,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:10,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 16:50:10,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 16:50:10,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:10,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:10,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:10,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134780864] [2025-03-03 16:50:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134780864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:50:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215142592] [2025-03-03 16:50:10,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:10,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:50:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:10,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:50:10,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:50:10,564 INFO L87 Difference]: Start difference. First operand 2084 states and 2944 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:12,671 INFO L93 Difference]: Finished difference Result 4617 states and 6557 transitions. [2025-03-03 16:50:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:50:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-03-03 16:50:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:12,673 INFO L225 Difference]: With dead ends: 4617 [2025-03-03 16:50:12,673 INFO L226 Difference]: Without dead ends: 2721 [2025-03-03 16:50:12,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:50:12,675 INFO L435 NwaCegarLoop]: 2193 mSDtfsCounter, 2958 mSDsluCounter, 6412 mSDsCounter, 0 mSdLazyCounter, 5657 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 8605 SdHoareTripleChecker+Invalid, 5658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:12,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2958 Valid, 8605 Invalid, 5658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5657 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 16:50:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2025-03-03 16:50:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2084. [2025-03-03 16:50:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 2083 states have (on average 1.4114258281325012) internal successors, (2940), 2083 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2940 transitions. [2025-03-03 16:50:12,691 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2940 transitions. Word has length 138 [2025-03-03 16:50:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:12,691 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 2940 transitions. [2025-03-03 16:50:12,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2940 transitions. [2025-03-03 16:50:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 16:50:12,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:12,691 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] [2025-03-03 16:50:12,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 16:50:12,691 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:12,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1495328905, now seen corresponding path program 1 times [2025-03-03 16:50:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371930083] [2025-03-03 16:50:12,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:12,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 16:50:12,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 16:50:12,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:12,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:12,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371930083] [2025-03-03 16:50:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371930083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:12,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:12,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:50:12,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154577985] [2025-03-03 16:50:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:12,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:50:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:12,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:50:12,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:50:12,905 INFO L87 Difference]: Start difference. First operand 2084 states and 2940 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:14,563 INFO L93 Difference]: Finished difference Result 4767 states and 6787 transitions. [2025-03-03 16:50:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:50:14,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-03 16:50:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:14,566 INFO L225 Difference]: With dead ends: 4767 [2025-03-03 16:50:14,566 INFO L226 Difference]: Without dead ends: 2871 [2025-03-03 16:50:14,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:50:14,568 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 4514 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4514 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:14,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4514 Valid, 4433 Invalid, 3884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3882 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 16:50:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2025-03-03 16:50:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2034. [2025-03-03 16:50:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 2033 states have (on average 1.411706837186424) internal successors, (2870), 2033 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2870 transitions. [2025-03-03 16:50:14,580 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2870 transitions. Word has length 139 [2025-03-03 16:50:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:14,580 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2870 transitions. [2025-03-03 16:50:14,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2870 transitions. [2025-03-03 16:50:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 16:50:14,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:14,581 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] [2025-03-03 16:50:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 16:50:14,581 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:14,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -117799050, now seen corresponding path program 1 times [2025-03-03 16:50:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932515145] [2025-03-03 16:50:14,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:14,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 16:50:14,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 16:50:14,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:14,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932515145] [2025-03-03 16:50:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932515145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:14,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:50:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709337997] [2025-03-03 16:50:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:14,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:50:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:14,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:50:14,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:50:14,942 INFO L87 Difference]: Start difference. First operand 2034 states and 2870 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:16,760 INFO L93 Difference]: Finished difference Result 5009 states and 7123 transitions. [2025-03-03 16:50:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:50:16,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-03 16:50:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:16,763 INFO L225 Difference]: With dead ends: 5009 [2025-03-03 16:50:16,763 INFO L226 Difference]: Without dead ends: 3163 [2025-03-03 16:50:16,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:50:16,765 INFO L435 NwaCegarLoop]: 1260 mSDtfsCounter, 5061 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5061 SdHoareTripleChecker+Valid, 4652 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:16,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5061 Valid, 4652 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 16:50:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2025-03-03 16:50:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2042. [2025-03-03 16:50:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 2041 states have (on average 1.410093091621754) internal successors, (2878), 2041 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2878 transitions. [2025-03-03 16:50:16,778 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2878 transitions. Word has length 139 [2025-03-03 16:50:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:50:16,778 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 2878 transitions. [2025-03-03 16:50:16,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2878 transitions. [2025-03-03 16:50:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 16:50:16,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:50:16,778 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] [2025-03-03 16:50:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 16:50:16,778 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:50:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:50:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1857117407, now seen corresponding path program 1 times [2025-03-03 16:50:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:50:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657334429] [2025-03-03 16:50:16,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:50:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:50:16,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 16:50:16,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 16:50:16,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:50:16,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:50:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:50:17,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:50:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657334429] [2025-03-03 16:50:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657334429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:50:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:50:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:50:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591758908] [2025-03-03 16:50:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:50:17,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:50:17,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:50:17,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:50:17,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:50:17,112 INFO L87 Difference]: Start difference. First operand 2042 states and 2878 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:50:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:50:18,836 INFO L93 Difference]: Finished difference Result 4504 states and 6392 transitions. [2025-03-03 16:50:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:50:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-03 16:50:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:50:18,841 INFO L225 Difference]: With dead ends: 4504 [2025-03-03 16:50:18,841 INFO L226 Difference]: Without dead ends: 2650 [2025-03-03 16:50:18,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:50:18,843 INFO L435 NwaCegarLoop]: 2183 mSDtfsCounter, 2981 mSDsluCounter, 4816 mSDsCounter, 0 mSdLazyCounter, 4173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2981 SdHoareTripleChecker+Valid, 6999 SdHoareTripleChecker+Invalid, 4174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:50:18,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2981 Valid, 6999 Invalid, 4174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4173 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 16:50:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states.