./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.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.h_TreeArb.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 889216697607a3ef71c51d8e84a75d701eba6a2c1ee6a0bec339c47f3476a23a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:44,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:45,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:35:45,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:45,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:45,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:45,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:45,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:45,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:45,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:45,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:45,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:45,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:45,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:45,062 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:45,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:45,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:45,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:35:45,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:35:45,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:45,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:45,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:45,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:45,064 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 -> 889216697607a3ef71c51d8e84a75d701eba6a2c1ee6a0bec339c47f3476a23a [2025-03-03 17:35:45,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:45,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:45,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:45,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:45,315 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:45,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c [2025-03-03 17:35:46,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d80f6dc6/eb04a6cae90f4b96b762e1f9383d0f50/FLAGd5d5e22e9 [2025-03-03 17:35:46,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:46,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TreeArb.c [2025-03-03 17:35:46,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d80f6dc6/eb04a6cae90f4b96b762e1f9383d0f50/FLAGd5d5e22e9 [2025-03-03 17:35:46,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d80f6dc6/eb04a6cae90f4b96b762e1f9383d0f50 [2025-03-03 17:35:46,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:46,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:46,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:46,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:46,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:46,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:46" (1/1) ... [2025-03-03 17:35:46,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e3b71b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:46, skipping insertion in model container [2025-03-03 17:35:46,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:46" (1/1) ... [2025-03-03 17:35:46,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:47,111 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.h_TreeArb.c[1249,1262] [2025-03-03 17:35:47,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:47,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:47,411 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.h_TreeArb.c[1249,1262] [2025-03-03 17:35:47,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:47,582 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:47,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47 WrapperNode [2025-03-03 17:35:47,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:47,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:47,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:47,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:47,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:47,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:47,906 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3993 [2025-03-03 17:35:47,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:47,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:47,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:47,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:47,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:47,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,162 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 17:35:48,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:48,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:48,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:48,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:48,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (1/1) ... [2025-03-03 17:35:48,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:48,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:48,412 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 17:35:48,415 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 17:35:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:35:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:48,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:48,788 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:48,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:51,264 INFO L? ?]: Removed 2723 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:51,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:51,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:51,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:51,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:51 BoogieIcfgContainer [2025-03-03 17:35:51,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:51,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:51,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:51,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:51,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:46" (1/3) ... [2025-03-03 17:35:51,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790a775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:51, skipping insertion in model container [2025-03-03 17:35:51,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:47" (2/3) ... [2025-03-03 17:35:51,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790a775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:51, skipping insertion in model container [2025-03-03 17:35:51,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:51" (3/3) ... [2025-03-03 17:35:51,367 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_TreeArb.c [2025-03-03 17:35:51,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:51,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_TreeArb.c that has 1 procedures, 726 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:51,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:51,446 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;@1473b3f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:51,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 726 states, 724 states have (on average 1.4986187845303867) internal successors, (1085), 725 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 17:35:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 17:35:51,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:51,460 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] [2025-03-03 17:35:51,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1864099079, now seen corresponding path program 1 times [2025-03-03 17:35:51,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:51,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198611978] [2025-03-03 17:35:51,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:51,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 17:35:51,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 17:35:51,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:51,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:52,388 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 17:35:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198611978] [2025-03-03 17:35:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198611978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:52,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982026691] [2025-03-03 17:35:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:52,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:52,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:52,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:52,414 INFO L87 Difference]: Start difference. First operand has 726 states, 724 states have (on average 1.4986187845303867) internal successors, (1085), 725 states have internal predecessors, (1085), 0 states have call successors, (0), 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 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 17:35:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:52,915 INFO L93 Difference]: Finished difference Result 1389 states and 2079 transitions. [2025-03-03 17:35:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:52,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 17:35:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:52,928 INFO L225 Difference]: With dead ends: 1389 [2025-03-03 17:35:52,929 INFO L226 Difference]: Without dead ends: 725 [2025-03-03 17:35:52,935 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 17:35:52,936 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 0 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:52,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2695 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-03 17:35:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2025-03-03 17:35:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4958563535911602) internal successors, (1083), 724 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states 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 17:35:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1083 transitions. [2025-03-03 17:35:53,007 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1083 transitions. Word has length 85 [2025-03-03 17:35:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:53,007 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1083 transitions. [2025-03-03 17:35:53,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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 17:35:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1083 transitions. [2025-03-03 17:35:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 17:35:53,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:53,011 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] [2025-03-03 17:35:53,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:35:53,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:53,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1947816483, now seen corresponding path program 1 times [2025-03-03 17:35:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063824052] [2025-03-03 17:35:53,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:53,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 17:35:53,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 17:35:53,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:53,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:53,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 17:35:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:53,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063824052] [2025-03-03 17:35:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063824052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:53,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:53,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529626000] [2025-03-03 17:35:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:53,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:53,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:53,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:53,367 INFO L87 Difference]: Start difference. First operand 725 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:35:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:53,700 INFO L93 Difference]: Finished difference Result 1390 states and 2077 transitions. [2025-03-03 17:35:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 17:35:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:53,705 INFO L225 Difference]: With dead ends: 1390 [2025-03-03 17:35:53,705 INFO L226 Difference]: Without dead ends: 727 [2025-03-03 17:35:53,706 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 17:35:53,707 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 0 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:53,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2692 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-03 17:35:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-03-03 17:35:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.4944903581267217) internal successors, (1085), 726 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 17:35:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1085 transitions. [2025-03-03 17:35:53,726 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1085 transitions. Word has length 86 [2025-03-03 17:35:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:53,727 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1085 transitions. [2025-03-03 17:35:53,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 17:35:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1085 transitions. [2025-03-03 17:35:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 17:35:53,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:53,732 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] [2025-03-03 17:35:53,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:35:53,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:53,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1678741364, now seen corresponding path program 1 times [2025-03-03 17:35:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105619309] [2025-03-03 17:35:53,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:53,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 17:35:53,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 17:35:53,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:53,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:54,427 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 17:35:54,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:54,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105619309] [2025-03-03 17:35:54,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105619309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:54,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:54,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55073496] [2025-03-03 17:35:54,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:54,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:54,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:54,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:54,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:54,433 INFO L87 Difference]: Start difference. First operand 727 states and 1085 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:35:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:54,886 INFO L93 Difference]: Finished difference Result 1397 states and 2086 transitions. [2025-03-03 17:35:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:35:54,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 17:35:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:54,891 INFO L225 Difference]: With dead ends: 1397 [2025-03-03 17:35:54,892 INFO L226 Difference]: Without dead ends: 732 [2025-03-03 17:35:54,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:54,895 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 1 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:54,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4468 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-03 17:35:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2025-03-03 17:35:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.4924760601915186) internal successors, (1091), 731 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 17:35:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1091 transitions. [2025-03-03 17:35:54,911 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1091 transitions. Word has length 87 [2025-03-03 17:35:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:54,912 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1091 transitions. [2025-03-03 17:35:54,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 17:35:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1091 transitions. [2025-03-03 17:35:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 17:35:54,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:54,916 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] [2025-03-03 17:35:54,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:35:54,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:54,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash -419549241, now seen corresponding path program 1 times [2025-03-03 17:35:54,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:54,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700547760] [2025-03-03 17:35:54,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:54,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 17:35:55,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 17:35:55,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:55,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:55,596 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 17:35:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700547760] [2025-03-03 17:35:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700547760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:55,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:55,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:55,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944675141] [2025-03-03 17:35:55,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:55,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:55,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:55,598 INFO L87 Difference]: Start difference. First operand 732 states and 1091 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 17:35:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:56,496 INFO L93 Difference]: Finished difference Result 1953 states and 2911 transitions. [2025-03-03 17:35:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 17:35:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:56,502 INFO L225 Difference]: With dead ends: 1953 [2025-03-03 17:35:56,502 INFO L226 Difference]: Without dead ends: 1283 [2025-03-03 17:35:56,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:35:56,505 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2628 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2628 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:56,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2628 Valid, 4225 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 17:35:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-03-03 17:35:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 817. [2025-03-03 17:35:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.491421568627451) internal successors, (1217), 816 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states 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 17:35:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1217 transitions. [2025-03-03 17:35:56,522 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1217 transitions. Word has length 88 [2025-03-03 17:35:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:56,523 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1217 transitions. [2025-03-03 17:35:56,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 17:35:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1217 transitions. [2025-03-03 17:35:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 17:35:56,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:56,524 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] [2025-03-03 17:35:56,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:35:56,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:56,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1905229086, now seen corresponding path program 1 times [2025-03-03 17:35:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:56,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460716787] [2025-03-03 17:35:56,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:56,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 17:35:56,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 17:35:56,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:56,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:56,878 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 17:35:56,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460716787] [2025-03-03 17:35:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460716787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269494371] [2025-03-03 17:35:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:56,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:56,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:56,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:56,879 INFO L87 Difference]: Start difference. First operand 817 states and 1217 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 17:35:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:57,467 INFO L93 Difference]: Finished difference Result 1576 states and 2347 transitions. [2025-03-03 17:35:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 17:35:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:57,472 INFO L225 Difference]: With dead ends: 1576 [2025-03-03 17:35:57,472 INFO L226 Difference]: Without dead ends: 880 [2025-03-03 17:35:57,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:57,475 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 29 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5357 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:57,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 5357 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-03 17:35:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2025-03-03 17:35:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.4869169510807736) internal successors, (1307), 879 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states 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 17:35:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1307 transitions. [2025-03-03 17:35:57,495 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1307 transitions. Word has length 88 [2025-03-03 17:35:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:57,496 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1307 transitions. [2025-03-03 17:35:57,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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 17:35:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1307 transitions. [2025-03-03 17:35:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 17:35:57,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:57,497 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] [2025-03-03 17:35:57,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:35:57,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:57,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1131916812, now seen corresponding path program 1 times [2025-03-03 17:35:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606292900] [2025-03-03 17:35:57,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:57,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 17:35:57,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 17:35:57,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:57,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:57,889 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 17:35:57,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:57,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606292900] [2025-03-03 17:35:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606292900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:57,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:57,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097173335] [2025-03-03 17:35:57,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:57,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:57,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:57,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:57,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:57,891 INFO L87 Difference]: Start difference. First operand 880 states and 1307 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 17:35:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:58,222 INFO L93 Difference]: Finished difference Result 1677 states and 2492 transitions. [2025-03-03 17:35:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 17:35:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:58,225 INFO L225 Difference]: With dead ends: 1677 [2025-03-03 17:35:58,225 INFO L226 Difference]: Without dead ends: 944 [2025-03-03 17:35:58,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:58,226 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 28 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:58,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3587 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-03 17:35:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2025-03-03 17:35:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 1.4835630965005302) internal successors, (1399), 943 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states 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 17:35:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1399 transitions. [2025-03-03 17:35:58,244 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1399 transitions. Word has length 89 [2025-03-03 17:35:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:58,244 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1399 transitions. [2025-03-03 17:35:58,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 17:35:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1399 transitions. [2025-03-03 17:35:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 17:35:58,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:58,247 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] [2025-03-03 17:35:58,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:35:58,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:58,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:58,248 INFO L85 PathProgramCache]: Analyzing trace with hash -791771441, now seen corresponding path program 1 times [2025-03-03 17:35:58,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055652036] [2025-03-03 17:35:58,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:58,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 17:35:58,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 17:35:58,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:58,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:58,808 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 17:35:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055652036] [2025-03-03 17:35:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055652036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730502554] [2025-03-03 17:35:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:58,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:58,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:58,810 INFO L87 Difference]: Start difference. First operand 944 states and 1399 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 17:35:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:59,917 INFO L93 Difference]: Finished difference Result 2223 states and 3293 transitions. [2025-03-03 17:35:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 17:35:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:59,922 INFO L225 Difference]: With dead ends: 2223 [2025-03-03 17:35:59,922 INFO L226 Difference]: Without dead ends: 1458 [2025-03-03 17:35:59,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:35:59,924 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2707 mSDsluCounter, 5064 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2707 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:59,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2707 Valid, 5910 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:35:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-03-03 17:35:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 964. [2025-03-03 17:35:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.4818276220145379) internal successors, (1427), 963 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states 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 17:35:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1427 transitions. [2025-03-03 17:35:59,946 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1427 transitions. Word has length 89 [2025-03-03 17:35:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:59,947 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1427 transitions. [2025-03-03 17:35:59,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 17:35:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1427 transitions. [2025-03-03 17:35:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 17:35:59,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:59,948 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] [2025-03-03 17:35:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:35:59,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1358350279, now seen corresponding path program 1 times [2025-03-03 17:35:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390053542] [2025-03-03 17:35:59,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:59,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 17:36:00,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 17:36:00,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:00,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:00,510 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 17:36:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:00,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390053542] [2025-03-03 17:36:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390053542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:00,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:36:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246096081] [2025-03-03 17:36:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:00,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:36:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:00,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:36:00,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:36:00,511 INFO L87 Difference]: Start difference. First operand 964 states and 1427 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 17:36:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:01,365 INFO L93 Difference]: Finished difference Result 2264 states and 3351 transitions. [2025-03-03 17:36:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:36:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 17:36:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:01,369 INFO L225 Difference]: With dead ends: 2264 [2025-03-03 17:36:01,369 INFO L226 Difference]: Without dead ends: 1412 [2025-03-03 17:36:01,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:36:01,370 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2534 mSDsluCounter, 4223 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 5069 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:01,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 5069 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 17:36:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-03-03 17:36:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 990. [2025-03-03 17:36:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4792719919110213) internal successors, (1463), 989 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states 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 17:36:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1463 transitions. [2025-03-03 17:36:01,386 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1463 transitions. Word has length 89 [2025-03-03 17:36:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:01,386 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1463 transitions. [2025-03-03 17:36:01,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 17:36:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1463 transitions. [2025-03-03 17:36:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:36:01,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:01,387 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] [2025-03-03 17:36:01,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:36:01,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:01,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1363123818, now seen corresponding path program 1 times [2025-03-03 17:36:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:01,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221433526] [2025-03-03 17:36:01,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:01,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:01,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:36:01,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:36:01,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:01,795 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 17:36:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221433526] [2025-03-03 17:36:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221433526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619425883] [2025-03-03 17:36:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:01,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:01,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:01,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:01,798 INFO L87 Difference]: Start difference. First operand 990 states and 1463 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 17:36:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:02,544 INFO L93 Difference]: Finished difference Result 2312 states and 3417 transitions. [2025-03-03 17:36:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 17:36:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:02,548 INFO L225 Difference]: With dead ends: 2312 [2025-03-03 17:36:02,548 INFO L226 Difference]: Without dead ends: 1426 [2025-03-03 17:36:02,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:02,550 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2520 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:02,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2520 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:36:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-03-03 17:36:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 992. [2025-03-03 17:36:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 1.4762865792129163) internal successors, (1463), 991 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states 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 17:36:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1463 transitions. [2025-03-03 17:36:02,566 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1463 transitions. Word has length 90 [2025-03-03 17:36:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:02,566 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1463 transitions. [2025-03-03 17:36:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 17:36:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1463 transitions. [2025-03-03 17:36:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:36:02,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:02,571 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] [2025-03-03 17:36:02,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:36:02,571 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:02,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -638826378, now seen corresponding path program 1 times [2025-03-03 17:36:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:02,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40580038] [2025-03-03 17:36:02,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:02,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:36:02,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:36:02,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:02,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:03,113 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 17:36:03,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:03,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40580038] [2025-03-03 17:36:03,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40580038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:03,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:03,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144875695] [2025-03-03 17:36:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:03,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:03,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:03,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:03,115 INFO L87 Difference]: Start difference. First operand 992 states and 1463 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 17:36:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:03,865 INFO L93 Difference]: Finished difference Result 2221 states and 3283 transitions. [2025-03-03 17:36:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 17:36:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:03,869 INFO L225 Difference]: With dead ends: 2221 [2025-03-03 17:36:03,869 INFO L226 Difference]: Without dead ends: 1428 [2025-03-03 17:36:03,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:03,871 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2500 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2500 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:03,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2500 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:36:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-03 17:36:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 994. [2025-03-03 17:36:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 1.4733131923464249) internal successors, (1463), 993 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states 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 17:36:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1463 transitions. [2025-03-03 17:36:03,886 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1463 transitions. Word has length 90 [2025-03-03 17:36:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:03,886 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1463 transitions. [2025-03-03 17:36:03,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 17:36:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1463 transitions. [2025-03-03 17:36:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:36:03,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:03,887 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] [2025-03-03 17:36:03,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:36:03,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:03,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1648819638, now seen corresponding path program 1 times [2025-03-03 17:36:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:03,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905715050] [2025-03-03 17:36:03,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:03,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:36:03,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:36:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:04,468 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 17:36:04,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:04,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905715050] [2025-03-03 17:36:04,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905715050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:04,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:36:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473673975] [2025-03-03 17:36:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:36:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:04,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:36:04,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:36:04,470 INFO L87 Difference]: Start difference. First operand 994 states and 1463 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 17:36:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:05,355 INFO L93 Difference]: Finished difference Result 2230 states and 3282 transitions. [2025-03-03 17:36:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:36:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 17:36:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:05,358 INFO L225 Difference]: With dead ends: 2230 [2025-03-03 17:36:05,358 INFO L226 Difference]: Without dead ends: 1309 [2025-03-03 17:36:05,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:36:05,360 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2176 mSDsluCounter, 5064 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 5910 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:05,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 5910 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 17:36:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-03-03 17:36:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1007. [2025-03-03 17:36:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 1.4721669980119285) internal successors, (1481), 1006 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states 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 17:36:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1481 transitions. [2025-03-03 17:36:05,375 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1481 transitions. Word has length 90 [2025-03-03 17:36:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:05,375 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1481 transitions. [2025-03-03 17:36:05,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 17:36:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1481 transitions. [2025-03-03 17:36:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 17:36:05,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:05,376 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] [2025-03-03 17:36:05,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:36:05,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:05,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1208620310, now seen corresponding path program 1 times [2025-03-03 17:36:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053114717] [2025-03-03 17:36:05,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:05,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 17:36:05,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 17:36:05,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:05,990 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 17:36:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:05,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053114717] [2025-03-03 17:36:05,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053114717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:05,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:05,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789548629] [2025-03-03 17:36:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:05,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:05,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:05,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:05,992 INFO L87 Difference]: Start difference. First operand 1007 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 17:36:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:06,646 INFO L93 Difference]: Finished difference Result 2126 states and 3133 transitions. [2025-03-03 17:36:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 17:36:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:06,649 INFO L225 Difference]: With dead ends: 2126 [2025-03-03 17:36:06,649 INFO L226 Difference]: Without dead ends: 1323 [2025-03-03 17:36:06,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:06,650 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2134 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2134 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:06,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2134 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-03-03 17:36:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1009. [2025-03-03 17:36:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4692460317460319) internal successors, (1481), 1008 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states 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 17:36:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1481 transitions. [2025-03-03 17:36:06,663 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1481 transitions. Word has length 91 [2025-03-03 17:36:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:06,663 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1481 transitions. [2025-03-03 17:36:06,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 17:36:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1481 transitions. [2025-03-03 17:36:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 17:36:06,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:06,664 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] [2025-03-03 17:36:06,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:36:06,664 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash -696165662, now seen corresponding path program 1 times [2025-03-03 17:36:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576612553] [2025-03-03 17:36:06,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:06,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 17:36:06,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 17:36:06,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:06,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:07,028 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 17:36:07,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576612553] [2025-03-03 17:36:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576612553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:07,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621117778] [2025-03-03 17:36:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:07,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:07,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:07,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:07,031 INFO L87 Difference]: Start difference. First operand 1009 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 17:36:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:07,714 INFO L93 Difference]: Finished difference Result 2161 states and 3171 transitions. [2025-03-03 17:36:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 17:36:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:07,717 INFO L225 Difference]: With dead ends: 2161 [2025-03-03 17:36:07,717 INFO L226 Difference]: Without dead ends: 1261 [2025-03-03 17:36:07,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:07,719 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1954 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:07,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-03 17:36:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1011. [2025-03-03 17:36:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4663366336633663) internal successors, (1481), 1010 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states 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 17:36:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1481 transitions. [2025-03-03 17:36:07,732 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1481 transitions. Word has length 91 [2025-03-03 17:36:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:07,733 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1481 transitions. [2025-03-03 17:36:07,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 17:36:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1481 transitions. [2025-03-03 17:36:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 17:36:07,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:07,734 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] [2025-03-03 17:36:07,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:36:07,734 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:07,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 399771960, now seen corresponding path program 1 times [2025-03-03 17:36:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030489474] [2025-03-03 17:36:07,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:07,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 17:36:07,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 17:36:07,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:07,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:08,168 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 17:36:08,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:08,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030489474] [2025-03-03 17:36:08,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030489474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:08,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:08,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:08,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105418938] [2025-03-03 17:36:08,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:08,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:08,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:08,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:08,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:08,171 INFO L87 Difference]: Start difference. First operand 1011 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 17:36:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:08,887 INFO L93 Difference]: Finished difference Result 2268 states and 3324 transitions. [2025-03-03 17:36:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:08,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 17:36:08,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:08,890 INFO L225 Difference]: With dead ends: 2268 [2025-03-03 17:36:08,891 INFO L226 Difference]: Without dead ends: 1326 [2025-03-03 17:36:08,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:08,892 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 2154 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:08,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:36:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-03 17:36:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1012. [2025-03-03 17:36:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4648862512363996) internal successors, (1481), 1011 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states 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 17:36:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1481 transitions. [2025-03-03 17:36:08,904 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1481 transitions. Word has length 91 [2025-03-03 17:36:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:08,904 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1481 transitions. [2025-03-03 17:36:08,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 17:36:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1481 transitions. [2025-03-03 17:36:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 17:36:08,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:08,905 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] [2025-03-03 17:36:08,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:36:08,905 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:08,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash 263742459, now seen corresponding path program 1 times [2025-03-03 17:36:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:08,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249904313] [2025-03-03 17:36:08,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:08,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:08,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 17:36:08,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 17:36:08,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:08,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:09,199 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 17:36:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:09,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249904313] [2025-03-03 17:36:09,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249904313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:09,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:09,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149655220] [2025-03-03 17:36:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:09,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:09,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:09,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:09,201 INFO L87 Difference]: Start difference. First operand 1012 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 17:36:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:09,680 INFO L93 Difference]: Finished difference Result 2122 states and 3111 transitions. [2025-03-03 17:36:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 17:36:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:09,683 INFO L225 Difference]: With dead ends: 2122 [2025-03-03 17:36:09,683 INFO L226 Difference]: Without dead ends: 1222 [2025-03-03 17:36:09,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:09,684 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1957 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:09,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 2546 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-03-03 17:36:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 960. [2025-03-03 17:36:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.4650677789363922) internal successors, (1405), 959 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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 17:36:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1405 transitions. [2025-03-03 17:36:09,695 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1405 transitions. Word has length 92 [2025-03-03 17:36:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:09,695 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1405 transitions. [2025-03-03 17:36:09,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 17:36:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1405 transitions. [2025-03-03 17:36:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 17:36:09,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:09,696 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] [2025-03-03 17:36:09,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:36:09,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:09,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2100700709, now seen corresponding path program 1 times [2025-03-03 17:36:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:09,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247652047] [2025-03-03 17:36:09,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:09,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 17:36:09,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 17:36:09,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:09,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:09,979 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 17:36:09,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:09,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247652047] [2025-03-03 17:36:09,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247652047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:09,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:09,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750316706] [2025-03-03 17:36:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:09,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:09,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:09,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:09,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:09,983 INFO L87 Difference]: Start difference. First operand 960 states and 1405 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 17:36:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:10,462 INFO L93 Difference]: Finished difference Result 1975 states and 2905 transitions. [2025-03-03 17:36:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 17:36:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:10,465 INFO L225 Difference]: With dead ends: 1975 [2025-03-03 17:36:10,465 INFO L226 Difference]: Without dead ends: 1172 [2025-03-03 17:36:10,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:10,467 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1917 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1917 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:10,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1917 Valid, 2546 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-03 17:36:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 924. [2025-03-03 17:36:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.465872156013001) internal successors, (1353), 923 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states 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 17:36:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1353 transitions. [2025-03-03 17:36:10,488 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1353 transitions. Word has length 92 [2025-03-03 17:36:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:10,488 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1353 transitions. [2025-03-03 17:36:10,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 17:36:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1353 transitions. [2025-03-03 17:36:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 17:36:10,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:10,489 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] [2025-03-03 17:36:10,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:36:10,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:10,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1365014161, now seen corresponding path program 1 times [2025-03-03 17:36:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563911484] [2025-03-03 17:36:10,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:10,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 17:36:10,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 17:36:10,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:10,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:10,864 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 17:36:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563911484] [2025-03-03 17:36:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563911484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:10,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:10,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282568176] [2025-03-03 17:36:10,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:10,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:10,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:10,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:10,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:10,865 INFO L87 Difference]: Start difference. First operand 924 states and 1353 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 17:36:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:11,485 INFO L93 Difference]: Finished difference Result 2214 states and 3250 transitions. [2025-03-03 17:36:11,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:11,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 17:36:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:11,489 INFO L225 Difference]: With dead ends: 2214 [2025-03-03 17:36:11,489 INFO L226 Difference]: Without dead ends: 1386 [2025-03-03 17:36:11,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:11,491 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2572 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:11,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 4225 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-03 17:36:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 922. [2025-03-03 17:36:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 1.4647122692725298) internal successors, (1349), 921 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states 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 17:36:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1349 transitions. [2025-03-03 17:36:11,499 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1349 transitions. Word has length 92 [2025-03-03 17:36:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:11,500 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1349 transitions. [2025-03-03 17:36:11,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 17:36:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1349 transitions. [2025-03-03 17:36:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 17:36:11,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:11,500 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] [2025-03-03 17:36:11,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:36:11,500 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:11,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1027025854, now seen corresponding path program 1 times [2025-03-03 17:36:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:11,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597612306] [2025-03-03 17:36:11,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:11,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 17:36:11,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 17:36:11,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:11,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:11,801 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 17:36:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597612306] [2025-03-03 17:36:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597612306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:11,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323334880] [2025-03-03 17:36:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:11,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:11,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:11,803 INFO L87 Difference]: Start difference. First operand 922 states and 1349 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 17:36:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:12,438 INFO L93 Difference]: Finished difference Result 2016 states and 2950 transitions. [2025-03-03 17:36:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 17:36:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:12,443 INFO L225 Difference]: With dead ends: 2016 [2025-03-03 17:36:12,443 INFO L226 Difference]: Without dead ends: 1159 [2025-03-03 17:36:12,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:12,445 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 1908 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:12,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 4230 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-03 17:36:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 923. [2025-03-03 17:36:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4631236442516269) internal successors, (1349), 922 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states 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 17:36:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1349 transitions. [2025-03-03 17:36:12,458 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1349 transitions. Word has length 93 [2025-03-03 17:36:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:12,458 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1349 transitions. [2025-03-03 17:36:12,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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 17:36:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1349 transitions. [2025-03-03 17:36:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 17:36:12,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:12,460 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] [2025-03-03 17:36:12,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:36:12,460 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:12,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash 399872414, now seen corresponding path program 1 times [2025-03-03 17:36:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591537385] [2025-03-03 17:36:12,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:12,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 17:36:12,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 17:36:12,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:12,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:12,716 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 17:36:12,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:12,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591537385] [2025-03-03 17:36:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591537385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:12,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:12,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647472195] [2025-03-03 17:36:12,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:12,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:12,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:12,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:12,718 INFO L87 Difference]: Start difference. First operand 923 states and 1349 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:13,206 INFO L93 Difference]: Finished difference Result 1949 states and 2861 transitions. [2025-03-03 17:36:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 17:36:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:13,209 INFO L225 Difference]: With dead ends: 1949 [2025-03-03 17:36:13,209 INFO L226 Difference]: Without dead ends: 1092 [2025-03-03 17:36:13,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:13,210 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 1891 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:13,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 2546 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-03 17:36:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 859. [2025-03-03 17:36:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.472027972027972) internal successors, (1263), 858 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states 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 17:36:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1263 transitions. [2025-03-03 17:36:13,217 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1263 transitions. Word has length 94 [2025-03-03 17:36:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:13,218 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1263 transitions. [2025-03-03 17:36:13,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1263 transitions. [2025-03-03 17:36:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-03-03 17:36:13,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:13,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:36:13,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:36:13,221 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash -119752639, now seen corresponding path program 1 times [2025-03-03 17:36:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393198749] [2025-03-03 17:36:13,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:13,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-03 17:36:18,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-03 17:36:18,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:18,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:19,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:19,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393198749] [2025-03-03 17:36:19,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393198749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:19,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:19,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:19,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652131309] [2025-03-03 17:36:19,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:19,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:19,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:19,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:19,392 INFO L87 Difference]: Start difference. First operand 859 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 17:36:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:20,044 INFO L93 Difference]: Finished difference Result 2227 states and 3296 transitions. [2025-03-03 17:36:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:20,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 419 [2025-03-03 17:36:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:20,047 INFO L225 Difference]: With dead ends: 2227 [2025-03-03 17:36:20,047 INFO L226 Difference]: Without dead ends: 863 [2025-03-03 17:36:20,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:20,048 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 700 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 4908 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:20,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 4908 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-03 17:36:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 861. [2025-03-03 17:36:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.4709302325581395) internal successors, (1265), 860 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states 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 17:36:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1265 transitions. [2025-03-03 17:36:20,056 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1265 transitions. Word has length 419 [2025-03-03 17:36:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:20,056 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1265 transitions. [2025-03-03 17:36:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 17:36:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1265 transitions. [2025-03-03 17:36:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-03 17:36:20,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:20,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:36:20,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:36:20,060 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:20,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -120957454, now seen corresponding path program 1 times [2025-03-03 17:36:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051326650] [2025-03-03 17:36:20,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:20,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-03 17:36:25,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-03 17:36:25,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:25,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051326650] [2025-03-03 17:36:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051326650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:26,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:26,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:26,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972713927] [2025-03-03 17:36:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:26,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:26,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:26,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:26,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:26,555 INFO L87 Difference]: Start difference. First operand 861 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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 17:36:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:26,982 INFO L93 Difference]: Finished difference Result 1696 states and 2505 transitions. [2025-03-03 17:36:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 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 420 [2025-03-03 17:36:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:26,985 INFO L225 Difference]: With dead ends: 1696 [2025-03-03 17:36:26,985 INFO L226 Difference]: Without dead ends: 865 [2025-03-03 17:36:26,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:26,986 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 76 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:26,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 3340 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-03 17:36:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 863. [2025-03-03 17:36:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4698375870069607) internal successors, (1267), 862 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states 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 17:36:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1267 transitions. [2025-03-03 17:36:26,994 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1267 transitions. Word has length 420 [2025-03-03 17:36:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1267 transitions. [2025-03-03 17:36:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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 17:36:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1267 transitions. [2025-03-03 17:36:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-03 17:36:26,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:26,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:36:26,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:36:26,996 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:26,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash -370518374, now seen corresponding path program 1 times [2025-03-03 17:36:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560100806] [2025-03-03 17:36:26,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:27,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-03 17:36:30,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-03 17:36:30,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:30,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:31,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560100806] [2025-03-03 17:36:31,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560100806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:31,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483579146] [2025-03-03 17:36:31,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:31,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:31,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:31,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:31,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:31,609 INFO L87 Difference]: Start difference. First operand 863 states and 1267 transitions. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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 17:36:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:32,040 INFO L93 Difference]: Finished difference Result 1658 states and 2446 transitions. [2025-03-03 17:36:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 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 421 [2025-03-03 17:36:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:32,043 INFO L225 Difference]: With dead ends: 1658 [2025-03-03 17:36:32,043 INFO L226 Difference]: Without dead ends: 867 [2025-03-03 17:36:32,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:32,047 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 42 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:32,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3355 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-03 17:36:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2025-03-03 17:36:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 864 states have (on average 1.46875) internal successors, (1269), 864 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states 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 17:36:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1269 transitions. [2025-03-03 17:36:32,057 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1269 transitions. Word has length 421 [2025-03-03 17:36:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:32,058 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1269 transitions. [2025-03-03 17:36:32,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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 17:36:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1269 transitions. [2025-03-03 17:36:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-03 17:36:32,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:32,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:36:32,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:36:32,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash 277147458, now seen corresponding path program 1 times [2025-03-03 17:36:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727035712] [2025-03-03 17:36:32,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:32,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-03 17:36:36,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-03 17:36:36,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:36,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727035712] [2025-03-03 17:36:37,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727035712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:37,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:37,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740391041] [2025-03-03 17:36:37,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:37,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:37,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:37,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:37,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:37,428 INFO L87 Difference]: Start difference. First operand 865 states and 1269 transitions. Second operand has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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 17:36:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:38,011 INFO L93 Difference]: Finished difference Result 1662 states and 2450 transitions. [2025-03-03 17:36:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 0 states have call successors, (0), 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 422 [2025-03-03 17:36:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:38,014 INFO L225 Difference]: With dead ends: 1662 [2025-03-03 17:36:38,014 INFO L226 Difference]: Without dead ends: 869 [2025-03-03 17:36:38,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:38,015 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 44 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:38,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4035 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-03 17:36:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 867. [2025-03-03 17:36:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.4676674364896074) internal successors, (1271), 866 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states 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 17:36:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1271 transitions. [2025-03-03 17:36:38,022 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1271 transitions. Word has length 422 [2025-03-03 17:36:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:38,022 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1271 transitions. [2025-03-03 17:36:38,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.33333333333333) internal successors, (422), 6 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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 17:36:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1271 transitions. [2025-03-03 17:36:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-03 17:36:38,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:38,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:36:38,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:36:38,024 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:38,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash 124268308, now seen corresponding path program 1 times [2025-03-03 17:36:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:38,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636013648] [2025-03-03 17:36:38,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:38,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-03 17:36:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-03 17:36:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:50,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636013648] [2025-03-03 17:36:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636013648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:51,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:51,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944861890] [2025-03-03 17:36:51,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:51,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:51,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:51,545 INFO L87 Difference]: Start difference. First operand 867 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 17:36:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:51,983 INFO L93 Difference]: Finished difference Result 1708 states and 2517 transitions. [2025-03-03 17:36:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:51,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 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 423 [2025-03-03 17:36:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:51,985 INFO L225 Difference]: With dead ends: 1708 [2025-03-03 17:36:51,985 INFO L226 Difference]: Without dead ends: 871 [2025-03-03 17:36:51,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:51,986 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 74 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:51,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 3347 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-03 17:36:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2025-03-03 17:36:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.4665898617511521) internal successors, (1273), 868 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states 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 17:36:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1273 transitions. [2025-03-03 17:36:51,993 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1273 transitions. Word has length 423 [2025-03-03 17:36:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:51,994 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1273 transitions. [2025-03-03 17:36:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 17:36:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1273 transitions. [2025-03-03 17:36:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-03 17:36:51,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:51,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:36:51,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 17:36:51,996 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:51,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1723232782, now seen corresponding path program 1 times [2025-03-03 17:36:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:51,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299597131] [2025-03-03 17:36:51,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:51,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:52,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-03 17:37:04,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-03 17:37:04,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:37:04,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:37:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:37:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:37:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299597131] [2025-03-03 17:37:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299597131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:37:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:37:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:37:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657447218] [2025-03-03 17:37:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:37:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:37:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:37:05,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:37:05,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:37:05,791 INFO L87 Difference]: Start difference. First operand 869 states and 1273 transitions. Second operand has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 17:37:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:37:06,350 INFO L93 Difference]: Finished difference Result 1629 states and 2397 transitions. [2025-03-03 17:37:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:37:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 0 states have call successors, (0), 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 424 [2025-03-03 17:37:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:37:06,352 INFO L225 Difference]: With dead ends: 1629 [2025-03-03 17:37:06,352 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 17:37:06,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:37:06,353 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 1085 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:37:06,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 2742 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:37:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 17:37:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 879. [2025-03-03 17:37:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.4658314350797266) internal successors, (1287), 878 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states 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 17:37:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1287 transitions. [2025-03-03 17:37:06,360 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1287 transitions. Word has length 424 [2025-03-03 17:37:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:37:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1287 transitions. [2025-03-03 17:37:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 17:37:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1287 transitions. [2025-03-03 17:37:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-03 17:37:06,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:37:06,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:37:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 17:37:06,362 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:37:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:37:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1973415441, now seen corresponding path program 1 times [2025-03-03 17:37:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:37:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105186196] [2025-03-03 17:37:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:37:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:37:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-03 17:37:09,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-03 17:37:09,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:37:09,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:37:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:37:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:37:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105186196] [2025-03-03 17:37:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105186196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:37:10,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:37:10,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:37:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11564091] [2025-03-03 17:37:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:37:10,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:37:10,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:37:10,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:37:10,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:37:10,923 INFO L87 Difference]: Start difference. First operand 879 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:37:11,418 INFO L93 Difference]: Finished difference Result 1640 states and 2412 transitions. [2025-03-03 17:37:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:37:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 425 [2025-03-03 17:37:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:37:11,420 INFO L225 Difference]: With dead ends: 1640 [2025-03-03 17:37:11,420 INFO L226 Difference]: Without dead ends: 883 [2025-03-03 17:37:11,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:37:11,421 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1054 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:37:11,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2060 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:37:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-03 17:37:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2025-03-03 17:37:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.4647727272727273) internal successors, (1289), 880 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states 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 17:37:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1289 transitions. [2025-03-03 17:37:11,430 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1289 transitions. Word has length 425 [2025-03-03 17:37:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:37:11,431 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1289 transitions. [2025-03-03 17:37:11,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:37:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1289 transitions. [2025-03-03 17:37:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-03 17:37:11,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:37:11,433 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:37:11,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 17:37:11,434 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:37:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:37:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1602535354, now seen corresponding path program 1 times [2025-03-03 17:37:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:37:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126966902] [2025-03-03 17:37:11,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:37:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms