./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6382bf7d3923cc5e5d05cc0b7a660c702c8db87925ef073e0a0a8704a68a4a3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:51:19,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:51:19,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:51:19,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:51:19,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:51:19,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:51:19,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:51:19,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:51:19,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:51:19,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:51:19,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:51:19,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:51:19,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:51:19,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:51:19,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:51:19,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:51:19,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:51:19,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:51:19,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:51:19,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:51:19,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:51:19,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6382bf7d3923cc5e5d05cc0b7a660c702c8db87925ef073e0a0a8704a68a4a3b [2025-03-03 14:51:20,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:51:20,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:51:20,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:51:20,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:51:20,107 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:51:20,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:51:21,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de997c0ec/a132c9220e0d425aa6ef5eac48e3aa3d/FLAG687173876 [2025-03-03 14:51:21,543 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:51:21,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:51:21,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de997c0ec/a132c9220e0d425aa6ef5eac48e3aa3d/FLAG687173876 [2025-03-03 14:51:21,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de997c0ec/a132c9220e0d425aa6ef5eac48e3aa3d [2025-03-03 14:51:21,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:51:21,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:51:21,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:51:21,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:51:21,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:51:21,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:51:21" (1/1) ... [2025-03-03 14:51:21,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bfd7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:21, skipping insertion in model container [2025-03-03 14:51:21,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:51:21" (1/1) ... [2025-03-03 14:51:21,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:51:22,045 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/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c[11298,11311] [2025-03-03 14:51:22,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:51:22,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:51:22,088 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/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c[11298,11311] [2025-03-03 14:51:22,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:51:22,100 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:51:22,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22 WrapperNode [2025-03-03 14:51:22,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:51:22,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:51:22,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:51:22,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:51:22,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,124 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 334 [2025-03-03 14:51:22,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:51:22,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:51:22,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:51:22,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:51:22,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,152 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 14:51:22,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:51:22,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:51:22,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:51:22,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:51:22,162 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (1/1) ... [2025-03-03 14:51:22,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:51:22,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:22,189 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 14:51:22,194 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 14:51:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:51:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:51:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:51:22,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:51:22,271 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:51:22,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:51:22,604 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-03 14:51:22,604 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:51:22,614 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:51:22,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:51:22,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:51:22 BoogieIcfgContainer [2025-03-03 14:51:22,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:51:22,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:51:22,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:51:22,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:51:22,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:51:21" (1/3) ... [2025-03-03 14:51:22,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8d8741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:51:22, skipping insertion in model container [2025-03-03 14:51:22,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:22" (2/3) ... [2025-03-03 14:51:22,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8d8741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:51:22, skipping insertion in model container [2025-03-03 14:51:22,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:51:22" (3/3) ... [2025-03-03 14:51:22,623 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:51:22,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:51:22,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:51:22,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:51:22,678 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;@322f27fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:51:22,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:51:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 82 states have (on average 1.7439024390243902) internal successors, (143), 83 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:51:22,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:22,687 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] [2025-03-03 14:51:22,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1990480123, now seen corresponding path program 1 times [2025-03-03 14:51:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:22,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023353754] [2025-03-03 14:51:22,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:22,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:51:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:51:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:22,868 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 14:51:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023353754] [2025-03-03 14:51:22,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023353754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:22,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:22,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:51:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429373186] [2025-03-03 14:51:22,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:22,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:51:22,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:22,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:51:22,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:51:22,886 INFO L87 Difference]: Start difference. First operand has 84 states, 82 states have (on average 1.7439024390243902) internal successors, (143), 83 states have internal predecessors, (143), 0 states have call successors, (0), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:22,901 INFO L93 Difference]: Finished difference Result 129 states and 216 transitions. [2025-03-03 14:51:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:51:22,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-03 14:51:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:22,910 INFO L225 Difference]: With dead ends: 129 [2025-03-03 14:51:22,910 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 14:51:22,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:51:22,914 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:22,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 14:51:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 14:51:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.725) internal successors, (138), 80 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 138 transitions. [2025-03-03 14:51:22,938 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 138 transitions. Word has length 23 [2025-03-03 14:51:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 138 transitions. [2025-03-03 14:51:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 138 transitions. [2025-03-03 14:51:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:51:22,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:22,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] [2025-03-03 14:51:22,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:51:22,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:22,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1307414820, now seen corresponding path program 1 times [2025-03-03 14:51:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38975396] [2025-03-03 14:51:22,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:22,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:51:22,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:51:22,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:22,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:23,154 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 14:51:23,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:23,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38975396] [2025-03-03 14:51:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38975396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:23,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:51:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915640800] [2025-03-03 14:51:23,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:51:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:23,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:51:23,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:51:23,156 INFO L87 Difference]: Start difference. First operand 81 states and 138 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:23,231 INFO L93 Difference]: Finished difference Result 129 states and 212 transitions. [2025-03-03 14:51:23,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:51:23,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-03 14:51:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:23,232 INFO L225 Difference]: With dead ends: 129 [2025-03-03 14:51:23,232 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 14:51:23,232 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 14:51:23,232 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:23,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 14:51:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 14:51:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2025-03-03 14:51:23,237 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 23 [2025-03-03 14:51:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:23,237 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2025-03-03 14:51:23,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2025-03-03 14:51:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:51:23,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:23,241 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] [2025-03-03 14:51:23,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:51:23,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:23,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1225116358, now seen corresponding path program 1 times [2025-03-03 14:51:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:23,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551444715] [2025-03-03 14:51:23,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:23,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:51:23,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:51:23,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:23,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:23,443 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 14:51:23,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:23,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551444715] [2025-03-03 14:51:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551444715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:23,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:23,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:23,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18771850] [2025-03-03 14:51:23,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:23,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:23,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:23,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:23,445 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:23,658 INFO L93 Difference]: Finished difference Result 521 states and 807 transitions. [2025-03-03 14:51:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:51:23,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 14:51:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:23,661 INFO L225 Difference]: With dead ends: 521 [2025-03-03 14:51:23,661 INFO L226 Difference]: Without dead ends: 477 [2025-03-03 14:51:23,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:51:23,662 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 784 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:23,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1257 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-03 14:51:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 123. [2025-03-03 14:51:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2025-03-03 14:51:23,677 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 53 [2025-03-03 14:51:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:23,677 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2025-03-03 14:51:23,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2025-03-03 14:51:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:51:23,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:23,681 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] [2025-03-03 14:51:23,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:51:23,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1636134145, now seen corresponding path program 1 times [2025-03-03 14:51:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933620068] [2025-03-03 14:51:23,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:23,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:51:23,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:51:23,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:23,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:23,762 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 14:51:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933620068] [2025-03-03 14:51:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933620068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:23,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180992516] [2025-03-03 14:51:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:23,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:23,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:23,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:23,765 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:23,789 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2025-03-03 14:51:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:23,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 14:51:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:23,791 INFO L225 Difference]: With dead ends: 284 [2025-03-03 14:51:23,791 INFO L226 Difference]: Without dead ends: 198 [2025-03-03 14:51:23,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:23,792 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:23,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-03 14:51:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2025-03-03 14:51:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.471502590673575) internal successors, (284), 193 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2025-03-03 14:51:23,806 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 55 [2025-03-03 14:51:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2025-03-03 14:51:23,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2025-03-03 14:51:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:51:23,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:23,810 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] [2025-03-03 14:51:23,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:51:23,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:23,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1668457380, now seen corresponding path program 1 times [2025-03-03 14:51:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:23,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552674925] [2025-03-03 14:51:23,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:23,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:51:23,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:51:23,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:23,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:24,070 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 14:51:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:24,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552674925] [2025-03-03 14:51:24,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552674925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:24,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:24,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671514576] [2025-03-03 14:51:24,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:24,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:24,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:24,072 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:24,207 INFO L93 Difference]: Finished difference Result 353 states and 532 transitions. [2025-03-03 14:51:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 14:51:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:24,208 INFO L225 Difference]: With dead ends: 353 [2025-03-03 14:51:24,208 INFO L226 Difference]: Without dead ends: 196 [2025-03-03 14:51:24,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:51:24,209 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 171 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:24,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 366 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-03 14:51:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2025-03-03 14:51:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.461139896373057) internal successors, (282), 193 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2025-03-03 14:51:24,223 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 55 [2025-03-03 14:51:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:24,224 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2025-03-03 14:51:24,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2025-03-03 14:51:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:51:24,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,227 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] [2025-03-03 14:51:24,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:51:24,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash 213108961, now seen corresponding path program 1 times [2025-03-03 14:51:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680483293] [2025-03-03 14:51:24,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:51:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:51:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:24,456 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 14:51:24,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680483293] [2025-03-03 14:51:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680483293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:24,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:24,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:51:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309703432] [2025-03-03 14:51:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:51:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:51:24,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:24,459 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:24,495 INFO L93 Difference]: Finished difference Result 202 states and 291 transitions. [2025-03-03 14:51:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:51:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 14:51:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:24,496 INFO L225 Difference]: With dead ends: 202 [2025-03-03 14:51:24,496 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 14:51:24,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:24,497 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:24,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 14:51:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-03 14:51:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4422110552763818) internal successors, (287), 199 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 287 transitions. [2025-03-03 14:51:24,506 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 287 transitions. Word has length 56 [2025-03-03 14:51:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:24,506 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 287 transitions. [2025-03-03 14:51:24,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 287 transitions. [2025-03-03 14:51:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:24,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,508 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] [2025-03-03 14:51:24,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:51:24,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,508 INFO L85 PathProgramCache]: Analyzing trace with hash 717925794, now seen corresponding path program 1 times [2025-03-03 14:51:24,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106723096] [2025-03-03 14:51:24,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:24,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:24,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:24,566 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 14:51:24,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:24,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106723096] [2025-03-03 14:51:24,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106723096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:24,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409874513] [2025-03-03 14:51:24,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:24,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,567 INFO L87 Difference]: Start difference. First operand 200 states and 287 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:24,580 INFO L93 Difference]: Finished difference Result 510 states and 759 transitions. [2025-03-03 14:51:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:24,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:24,581 INFO L225 Difference]: With dead ends: 510 [2025-03-03 14:51:24,582 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 14:51:24,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,582 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 58 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:24,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 14:51:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2025-03-03 14:51:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.4651162790697674) internal successors, (504), 344 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 504 transitions. [2025-03-03 14:51:24,590 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 504 transitions. Word has length 57 [2025-03-03 14:51:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:24,590 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 504 transitions. [2025-03-03 14:51:24,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 504 transitions. [2025-03-03 14:51:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:24,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,590 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] [2025-03-03 14:51:24,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:51:24,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash 269980258, now seen corresponding path program 1 times [2025-03-03 14:51:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35553053] [2025-03-03 14:51:24,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:24,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:24,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:24,631 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 14:51:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35553053] [2025-03-03 14:51:24,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35553053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:24,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:24,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014798229] [2025-03-03 14:51:24,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:24,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,632 INFO L87 Difference]: Start difference. First operand 345 states and 504 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:24,647 INFO L93 Difference]: Finished difference Result 929 states and 1382 transitions. [2025-03-03 14:51:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:24,650 INFO L225 Difference]: With dead ends: 929 [2025-03-03 14:51:24,650 INFO L226 Difference]: Without dead ends: 621 [2025-03-03 14:51:24,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,651 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 56 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:24,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-03 14:51:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 619. [2025-03-03 14:51:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 1.4660194174757282) internal successors, (906), 618 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 906 transitions. [2025-03-03 14:51:24,668 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 906 transitions. Word has length 57 [2025-03-03 14:51:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:24,671 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 906 transitions. [2025-03-03 14:51:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 906 transitions. [2025-03-03 14:51:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:24,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,672 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] [2025-03-03 14:51:24,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:51:24,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 685156130, now seen corresponding path program 1 times [2025-03-03 14:51:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156393611] [2025-03-03 14:51:24,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:24,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:24,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:24,717 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 14:51:24,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156393611] [2025-03-03 14:51:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156393611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:24,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:24,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458811633] [2025-03-03 14:51:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:24,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,720 INFO L87 Difference]: Start difference. First operand 619 states and 906 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:24,743 INFO L93 Difference]: Finished difference Result 1719 states and 2532 transitions. [2025-03-03 14:51:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:24,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:24,747 INFO L225 Difference]: With dead ends: 1719 [2025-03-03 14:51:24,747 INFO L226 Difference]: Without dead ends: 1137 [2025-03-03 14:51:24,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,748 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 54 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:24,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 233 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-03 14:51:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2025-03-03 14:51:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.4514991181657848) internal successors, (1646), 1134 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1646 transitions. [2025-03-03 14:51:24,794 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1646 transitions. Word has length 57 [2025-03-03 14:51:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:24,794 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1646 transitions. [2025-03-03 14:51:24,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1646 transitions. [2025-03-03 14:51:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:24,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,794 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] [2025-03-03 14:51:24,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:51:24,795 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash 198437858, now seen corresponding path program 1 times [2025-03-03 14:51:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920835300] [2025-03-03 14:51:24,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:24,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:24,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:24,832 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 14:51:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920835300] [2025-03-03 14:51:24,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920835300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:24,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:24,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:24,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988682095] [2025-03-03 14:51:24,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:24,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:24,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,833 INFO L87 Difference]: Start difference. First operand 1135 states and 1646 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:24,872 INFO L93 Difference]: Finished difference Result 3203 states and 4640 transitions. [2025-03-03 14:51:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:24,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:24,879 INFO L225 Difference]: With dead ends: 3203 [2025-03-03 14:51:24,879 INFO L226 Difference]: Without dead ends: 2105 [2025-03-03 14:51:24,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,882 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 52 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:24,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 235 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2025-03-03 14:51:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2103. [2025-03-03 14:51:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2102 states have (on average 1.4262607040913415) internal successors, (2998), 2102 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2998 transitions. [2025-03-03 14:51:24,942 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2998 transitions. Word has length 57 [2025-03-03 14:51:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:24,943 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 2998 transitions. [2025-03-03 14:51:24,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2998 transitions. [2025-03-03 14:51:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 14:51:24,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,943 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] [2025-03-03 14:51:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:51:24,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2075347326, now seen corresponding path program 1 times [2025-03-03 14:51:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127561291] [2025-03-03 14:51:24,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 14:51:24,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 14:51:24,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127561291] [2025-03-03 14:51:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127561291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436423696] [2025-03-03 14:51:24,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:24,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:24,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:24,985 INFO L87 Difference]: Start difference. First operand 2103 states and 2998 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:25,048 INFO L93 Difference]: Finished difference Result 4286 states and 6172 transitions. [2025-03-03 14:51:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:25,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 14:51:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:25,057 INFO L225 Difference]: With dead ends: 4286 [2025-03-03 14:51:25,057 INFO L226 Difference]: Without dead ends: 3099 [2025-03-03 14:51:25,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:25,059 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:25,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 230 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-03-03 14:51:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3097. [2025-03-03 14:51:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 3096 states have (on average 1.4186046511627908) internal successors, (4392), 3096 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4392 transitions. [2025-03-03 14:51:25,132 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4392 transitions. Word has length 59 [2025-03-03 14:51:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:25,133 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4392 transitions. [2025-03-03 14:51:25,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4392 transitions. [2025-03-03 14:51:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:25,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:25,135 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:25,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:51:25,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash -399013297, now seen corresponding path program 1 times [2025-03-03 14:51:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:25,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096410033] [2025-03-03 14:51:25,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:25,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:25,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:25,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:25,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:51:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096410033] [2025-03-03 14:51:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096410033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:25,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:25,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738725602] [2025-03-03 14:51:25,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:25,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:25,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:25,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:25,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:25,268 INFO L87 Difference]: Start difference. First operand 3097 states and 4392 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:25,579 INFO L93 Difference]: Finished difference Result 19045 states and 27054 transitions. [2025-03-03 14:51:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 14:51:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:25,626 INFO L225 Difference]: With dead ends: 19045 [2025-03-03 14:51:25,626 INFO L226 Difference]: Without dead ends: 15987 [2025-03-03 14:51:25,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:25,632 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 573 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:25,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 780 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15987 states. [2025-03-03 14:51:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15987 to 6153. [2025-03-03 14:51:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6152 states have (on average 1.4135240572171652) internal successors, (8696), 6152 states have internal predecessors, (8696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8696 transitions. [2025-03-03 14:51:25,890 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8696 transitions. Word has length 76 [2025-03-03 14:51:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:25,890 INFO L471 AbstractCegarLoop]: Abstraction has 6153 states and 8696 transitions. [2025-03-03 14:51:25,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8696 transitions. [2025-03-03 14:51:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:25,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:25,893 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:25,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:51:25,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:25,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -846958833, now seen corresponding path program 1 times [2025-03-03 14:51:25,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:25,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164859049] [2025-03-03 14:51:25,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:25,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:25,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:25,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:25,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:25,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:51:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164859049] [2025-03-03 14:51:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164859049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:26,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:26,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:26,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403876973] [2025-03-03 14:51:26,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:26,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:26,052 INFO L87 Difference]: Start difference. First operand 6153 states and 8696 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:26,419 INFO L93 Difference]: Finished difference Result 22101 states and 31358 transitions. [2025-03-03 14:51:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 14:51:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:26,463 INFO L225 Difference]: With dead ends: 22101 [2025-03-03 14:51:26,463 INFO L226 Difference]: Without dead ends: 19043 [2025-03-03 14:51:26,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:26,470 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 598 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:26,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 700 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19043 states. [2025-03-03 14:51:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19043 to 10745. [2025-03-03 14:51:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10745 states, 10744 states have (on average 1.4065524944154877) internal successors, (15112), 10744 states have internal predecessors, (15112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10745 states to 10745 states and 15112 transitions. [2025-03-03 14:51:26,790 INFO L78 Accepts]: Start accepts. Automaton has 10745 states and 15112 transitions. Word has length 76 [2025-03-03 14:51:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:26,790 INFO L471 AbstractCegarLoop]: Abstraction has 10745 states and 15112 transitions. [2025-03-03 14:51:26,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10745 states and 15112 transitions. [2025-03-03 14:51:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:26,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:26,792 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:26,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:51:26,792 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:26,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash -431782961, now seen corresponding path program 1 times [2025-03-03 14:51:26,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344100332] [2025-03-03 14:51:26,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:26,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:26,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:26,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:51:26,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344100332] [2025-03-03 14:51:26,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344100332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:26,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:26,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948472069] [2025-03-03 14:51:26,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:26,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:26,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:26,942 INFO L87 Difference]: Start difference. First operand 10745 states and 15112 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:27,406 INFO L93 Difference]: Finished difference Result 25157 states and 35662 transitions. [2025-03-03 14:51:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:27,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 14:51:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:27,445 INFO L225 Difference]: With dead ends: 25157 [2025-03-03 14:51:27,446 INFO L226 Difference]: Without dead ends: 22099 [2025-03-03 14:51:27,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:27,457 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 641 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:27,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 681 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22099 states. [2025-03-03 14:51:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22099 to 13801. [2025-03-03 14:51:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13801 states, 13800 states have (on average 1.4069565217391304) internal successors, (19416), 13800 states have internal predecessors, (19416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13801 states to 13801 states and 19416 transitions. [2025-03-03 14:51:27,860 INFO L78 Accepts]: Start accepts. Automaton has 13801 states and 19416 transitions. Word has length 76 [2025-03-03 14:51:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:27,861 INFO L471 AbstractCegarLoop]: Abstraction has 13801 states and 19416 transitions. [2025-03-03 14:51:27,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13801 states and 19416 transitions. [2025-03-03 14:51:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:27,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:27,862 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:27,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:51:27,863 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -918501233, now seen corresponding path program 1 times [2025-03-03 14:51:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184000905] [2025-03-03 14:51:27,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:27,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:27,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:27,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:27,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:51:28,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:28,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184000905] [2025-03-03 14:51:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184000905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:28,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804530930] [2025-03-03 14:51:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:28,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:28,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:28,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:28,024 INFO L87 Difference]: Start difference. First operand 13801 states and 19416 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:28,452 INFO L93 Difference]: Finished difference Result 28213 states and 39966 transitions. [2025-03-03 14:51:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 14:51:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:28,537 INFO L225 Difference]: With dead ends: 28213 [2025-03-03 14:51:28,537 INFO L226 Difference]: Without dead ends: 25155 [2025-03-03 14:51:28,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:28,544 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 587 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:28,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 735 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25155 states. [2025-03-03 14:51:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25155 to 16857. [2025-03-03 14:51:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16857 states, 16856 states have (on average 1.4072140484100617) internal successors, (23720), 16856 states have internal predecessors, (23720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16857 states to 16857 states and 23720 transitions. [2025-03-03 14:51:28,957 INFO L78 Accepts]: Start accepts. Automaton has 16857 states and 23720 transitions. Word has length 76 [2025-03-03 14:51:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:28,957 INFO L471 AbstractCegarLoop]: Abstraction has 16857 states and 23720 transitions. [2025-03-03 14:51:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 16857 states and 23720 transitions. [2025-03-03 14:51:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:51:28,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:28,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:51:28,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash -47012627, now seen corresponding path program 1 times [2025-03-03 14:51:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669518592] [2025-03-03 14:51:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:28,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:51:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:51:28,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:28,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669518592] [2025-03-03 14:51:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669518592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615060527] [2025-03-03 14:51:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:29,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:29,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:29,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:29,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:29,043 INFO L87 Difference]: Start difference. First operand 16857 states and 23720 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:29,248 INFO L93 Difference]: Finished difference Result 28849 states and 40815 transitions. [2025-03-03 14:51:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 14:51:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:29,268 INFO L225 Difference]: With dead ends: 28849 [2025-03-03 14:51:29,268 INFO L226 Difference]: Without dead ends: 12031 [2025-03-03 14:51:29,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:29,284 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 50 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:29,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 239 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12031 states. [2025-03-03 14:51:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12031 to 12029. [2025-03-03 14:51:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12029 states, 12028 states have (on average 1.4097106750914532) internal successors, (16956), 12028 states have internal predecessors, (16956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12029 states to 12029 states and 16956 transitions. [2025-03-03 14:51:29,570 INFO L78 Accepts]: Start accepts. Automaton has 12029 states and 16956 transitions. Word has length 78 [2025-03-03 14:51:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:29,570 INFO L471 AbstractCegarLoop]: Abstraction has 12029 states and 16956 transitions. [2025-03-03 14:51:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 12029 states and 16956 transitions. [2025-03-03 14:51:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:51:29,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:29,572 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:29,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:51:29,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:29,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1711989777, now seen corresponding path program 1 times [2025-03-03 14:51:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121930316] [2025-03-03 14:51:29,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:29,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:51:29,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:51:29,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:29,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121930316] [2025-03-03 14:51:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121930316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:29,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:29,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:29,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253780855] [2025-03-03 14:51:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:29,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:29,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:29,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:29,701 INFO L87 Difference]: Start difference. First operand 12029 states and 16956 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:30,020 INFO L93 Difference]: Finished difference Result 22921 states and 32482 transitions. [2025-03-03 14:51:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:30,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 78 [2025-03-03 14:51:30,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:30,052 INFO L225 Difference]: With dead ends: 22921 [2025-03-03 14:51:30,052 INFO L226 Difference]: Without dead ends: 20743 [2025-03-03 14:51:30,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:30,059 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 579 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:30,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 847 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2025-03-03 14:51:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 14205. [2025-03-03 14:51:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14205 states, 14204 states have (on average 1.410025344973247) internal successors, (20028), 14204 states have internal predecessors, (20028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14205 states to 14205 states and 20028 transitions. [2025-03-03 14:51:30,302 INFO L78 Accepts]: Start accepts. Automaton has 14205 states and 20028 transitions. Word has length 78 [2025-03-03 14:51:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:30,302 INFO L471 AbstractCegarLoop]: Abstraction has 14205 states and 20028 transitions. [2025-03-03 14:51:30,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 14205 states and 20028 transitions. [2025-03-03 14:51:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:51:30,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:30,304 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:51:30,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1124436642, now seen corresponding path program 1 times [2025-03-03 14:51:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278507548] [2025-03-03 14:51:30,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:30,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:51:30,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:51:30,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:30,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:30,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:30,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278507548] [2025-03-03 14:51:30,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278507548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:30,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:30,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:30,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862900189] [2025-03-03 14:51:30,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:30,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:30,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:30,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:30,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:30,384 INFO L87 Difference]: Start difference. First operand 14205 states and 20028 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:30,472 INFO L93 Difference]: Finished difference Result 21281 states and 30014 transitions. [2025-03-03 14:51:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 14:51:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:30,483 INFO L225 Difference]: With dead ends: 21281 [2025-03-03 14:51:30,484 INFO L226 Difference]: Without dead ends: 7135 [2025-03-03 14:51:30,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:30,494 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 45 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:30,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7135 states. [2025-03-03 14:51:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7135 to 7133. [2025-03-03 14:51:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7133 states, 7132 states have (on average 1.3937184520471115) internal successors, (9940), 7132 states have internal predecessors, (9940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9940 transitions. [2025-03-03 14:51:30,664 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9940 transitions. Word has length 79 [2025-03-03 14:51:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 7133 states and 9940 transitions. [2025-03-03 14:51:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9940 transitions. [2025-03-03 14:51:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:51:30,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:30,666 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:30,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:51:30,666 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:30,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:30,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1957282085, now seen corresponding path program 1 times [2025-03-03 14:51:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:30,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684102004] [2025-03-03 14:51:30,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:30,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:51:30,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:51:30,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:30,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:30,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:30,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684102004] [2025-03-03 14:51:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684102004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375758133] [2025-03-03 14:51:30,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:30,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:30,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:30,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:30,740 INFO L87 Difference]: Start difference. First operand 7133 states and 9940 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:30,787 INFO L93 Difference]: Finished difference Result 10673 states and 14882 transitions. [2025-03-03 14:51:30,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:30,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 14:51:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:30,793 INFO L225 Difference]: With dead ends: 10673 [2025-03-03 14:51:30,793 INFO L226 Difference]: Without dead ends: 3599 [2025-03-03 14:51:30,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:30,798 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 42 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:30,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 209 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-03-03 14:51:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3597. [2025-03-03 14:51:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3596 states have (on average 1.3759733036707453) internal successors, (4948), 3596 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 4948 transitions. [2025-03-03 14:51:30,849 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 4948 transitions. Word has length 81 [2025-03-03 14:51:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:30,849 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 4948 transitions. [2025-03-03 14:51:30,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 4948 transitions. [2025-03-03 14:51:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:51:30,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:30,851 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:30,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:51:30,851 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:30,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1708120564, now seen corresponding path program 1 times [2025-03-03 14:51:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:30,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512483294] [2025-03-03 14:51:30,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:30,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:51:30,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:51:30,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512483294] [2025-03-03 14:51:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512483294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139069168] [2025-03-03 14:51:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:30,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:30,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:30,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:30,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:30,916 INFO L87 Difference]: Start difference. First operand 3597 states and 4948 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:30,945 INFO L93 Difference]: Finished difference Result 5369 states and 7394 transitions. [2025-03-03 14:51:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 14:51:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:30,948 INFO L225 Difference]: With dead ends: 5369 [2025-03-03 14:51:30,948 INFO L226 Difference]: Without dead ends: 1831 [2025-03-03 14:51:30,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:30,953 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:30,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 194 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-03-03 14:51:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2025-03-03 14:51:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.3555798687089715) internal successors, (2478), 1828 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2478 transitions. [2025-03-03 14:51:30,982 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2478 transitions. Word has length 83 [2025-03-03 14:51:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2478 transitions. [2025-03-03 14:51:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2478 transitions. [2025-03-03 14:51:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:51:30,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:30,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:51:30,984 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash -103148525, now seen corresponding path program 1 times [2025-03-03 14:51:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014921738] [2025-03-03 14:51:30,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:30,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:51:31,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:51:31,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:31,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:31,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014921738] [2025-03-03 14:51:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014921738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:31,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:31,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:31,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034034665] [2025-03-03 14:51:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:31,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:31,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:31,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:31,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:31,054 INFO L87 Difference]: Start difference. First operand 1829 states and 2478 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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 14:51:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:31,070 INFO L93 Difference]: Finished difference Result 2717 states and 3689 transitions. [2025-03-03 14:51:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:31,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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 14:51:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:31,073 INFO L225 Difference]: With dead ends: 2717 [2025-03-03 14:51:31,073 INFO L226 Difference]: Without dead ends: 947 [2025-03-03 14:51:31,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:31,074 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:31,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 179 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-03 14:51:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 945. [2025-03-03 14:51:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 1.3305084745762712) internal successors, (1256), 944 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1256 transitions. [2025-03-03 14:51:31,089 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1256 transitions. Word has length 85 [2025-03-03 14:51:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:31,090 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1256 transitions. [2025-03-03 14:51:31,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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 14:51:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1256 transitions. [2025-03-03 14:51:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:51:31,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:31,091 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:31,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:51:31,092 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:31,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash 80083770, now seen corresponding path program 1 times [2025-03-03 14:51:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955362845] [2025-03-03 14:51:31,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:31,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:51:31,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:51:31,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:31,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:31,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955362845] [2025-03-03 14:51:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955362845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923895827] [2025-03-03 14:51:31,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:31,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:31,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:31,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:31,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:51:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:51:31,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:51:31,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:31,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:31,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:51:31,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:31,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:32,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923895827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:32,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:32,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 14:51:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320371455] [2025-03-03 14:51:32,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:32,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:51:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:32,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:51:32,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:51:32,658 INFO L87 Difference]: Start difference. First operand 945 states and 1256 transitions. Second operand has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:33,796 INFO L93 Difference]: Finished difference Result 4651 states and 6281 transitions. [2025-03-03 14:51:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 14:51:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 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 14:51:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:33,801 INFO L225 Difference]: With dead ends: 4651 [2025-03-03 14:51:33,801 INFO L226 Difference]: Without dead ends: 3765 [2025-03-03 14:51:33,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=574, Invalid=2288, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 14:51:33,804 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1912 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:33,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 785 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:51:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2025-03-03 14:51:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3701. [2025-03-03 14:51:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 3700 states have (on average 1.3232432432432433) internal successors, (4896), 3700 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 4896 transitions. [2025-03-03 14:51:33,877 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 4896 transitions. Word has length 87 [2025-03-03 14:51:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:33,877 INFO L471 AbstractCegarLoop]: Abstraction has 3701 states and 4896 transitions. [2025-03-03 14:51:33,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.96) internal successors, (224), 24 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 4896 transitions. [2025-03-03 14:51:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:51:33,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:33,878 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:33,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:51:34,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 14:51:34,079 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 118971894, now seen corresponding path program 1 times [2025-03-03 14:51:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217875435] [2025-03-03 14:51:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:51:34,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:51:34,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:34,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:34,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217875435] [2025-03-03 14:51:34,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217875435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:34,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060584869] [2025-03-03 14:51:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:34,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:34,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:34,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:34,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:51:34,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:51:35,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:51:35,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:35,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:35,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:51:35,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:35,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:36,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060584869] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:36,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:36,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 34 [2025-03-03 14:51:36,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632639418] [2025-03-03 14:51:36,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:36,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 14:51:36,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:36,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 14:51:36,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:51:36,477 INFO L87 Difference]: Start difference. First operand 3701 states and 4896 transitions. Second operand has 34 states, 34 states have (on average 6.823529411764706) internal successors, (232), 34 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:38,953 INFO L93 Difference]: Finished difference Result 20563 states and 27281 transitions. [2025-03-03 14:51:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-03 14:51:38,954 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.823529411764706) internal successors, (232), 34 states have internal predecessors, (232), 0 states have call successors, (0), 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 14:51:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:38,975 INFO L225 Difference]: With dead ends: 20563 [2025-03-03 14:51:38,975 INFO L226 Difference]: Without dead ends: 16921 [2025-03-03 14:51:38,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1410, Invalid=6962, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 14:51:38,982 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 2099 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:38,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 2190 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:51:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16921 states. [2025-03-03 14:51:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16921 to 10197. [2025-03-03 14:51:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10197 states, 10196 states have (on average 1.3091408395449196) internal successors, (13348), 10196 states have internal predecessors, (13348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10197 states to 10197 states and 13348 transitions. [2025-03-03 14:51:39,199 INFO L78 Accepts]: Start accepts. Automaton has 10197 states and 13348 transitions. Word has length 88 [2025-03-03 14:51:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:39,199 INFO L471 AbstractCegarLoop]: Abstraction has 10197 states and 13348 transitions. [2025-03-03 14:51:39,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.823529411764706) internal successors, (232), 34 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 10197 states and 13348 transitions. [2025-03-03 14:51:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:51:39,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:39,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:39,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:51:39,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 14:51:39,405 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:39,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash -806365010, now seen corresponding path program 1 times [2025-03-03 14:51:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079492331] [2025-03-03 14:51:39,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:39,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:51:39,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:51:39,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:39,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079492331] [2025-03-03 14:51:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079492331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043362627] [2025-03-03 14:51:39,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:39,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:39,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:51:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:51:39,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:51:39,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:39,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:51:39,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:40,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043362627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:40,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:40,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 14:51:40,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426683663] [2025-03-03 14:51:40,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:40,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:51:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:40,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:51:40,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:51:40,674 INFO L87 Difference]: Start difference. First operand 10197 states and 13348 transitions. Second operand has 25 states, 25 states have (on average 9.92) internal successors, (248), 24 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:41,774 INFO L93 Difference]: Finished difference Result 25675 states and 33737 transitions. [2025-03-03 14:51:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:51:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.92) internal successors, (248), 24 states have internal predecessors, (248), 0 states have call successors, (0), 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 14:51:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:41,791 INFO L225 Difference]: With dead ends: 25675 [2025-03-03 14:51:41,791 INFO L226 Difference]: Without dead ends: 15545 [2025-03-03 14:51:41,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=476, Invalid=1780, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 14:51:41,796 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1253 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:41,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 791 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:51:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2025-03-03 14:51:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 14745. [2025-03-03 14:51:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14745 states, 14744 states have (on average 1.2986977753662508) internal successors, (19148), 14744 states have internal predecessors, (19148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 19148 transitions. [2025-03-03 14:51:42,071 INFO L78 Accepts]: Start accepts. Automaton has 14745 states and 19148 transitions. Word has length 89 [2025-03-03 14:51:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:42,072 INFO L471 AbstractCegarLoop]: Abstraction has 14745 states and 19148 transitions. [2025-03-03 14:51:42,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.92) internal successors, (248), 24 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 14745 states and 19148 transitions. [2025-03-03 14:51:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:51:42,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:42,074 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:42,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:42,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:42,274 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:42,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1416282734, now seen corresponding path program 1 times [2025-03-03 14:51:42,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:42,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228740216] [2025-03-03 14:51:42,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:42,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:51:42,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:51:42,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:42,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228740216] [2025-03-03 14:51:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228740216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431963555] [2025-03-03 14:51:42,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:42,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:42,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:42,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:42,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:51:42,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:51:42,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:51:42,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:42,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:42,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:51:42,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:43,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431963555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:44,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-03 14:51:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989767821] [2025-03-03 14:51:44,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:44,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 14:51:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:44,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 14:51:44,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:51:44,061 INFO L87 Difference]: Start difference. First operand 14745 states and 19148 transitions. Second operand has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:48,500 INFO L93 Difference]: Finished difference Result 53489 states and 68303 transitions. [2025-03-03 14:51:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-03 14:51:48,500 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 0 states have call successors, (0), 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 14:51:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:48,538 INFO L225 Difference]: With dead ends: 53489 [2025-03-03 14:51:48,538 INFO L226 Difference]: Without dead ends: 46587 [2025-03-03 14:51:48,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2166, Invalid=10266, Unknown=0, NotChecked=0, Total=12432 [2025-03-03 14:51:48,548 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 2872 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2872 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:48,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2872 Valid, 2007 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2510 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:51:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46587 states. [2025-03-03 14:51:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46587 to 23009. [2025-03-03 14:51:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23009 states, 23008 states have (on average 1.2852051460361613) internal successors, (29570), 23008 states have internal predecessors, (29570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23009 states to 23009 states and 29570 transitions. [2025-03-03 14:51:49,126 INFO L78 Accepts]: Start accepts. Automaton has 23009 states and 29570 transitions. Word has length 91 [2025-03-03 14:51:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:49,126 INFO L471 AbstractCegarLoop]: Abstraction has 23009 states and 29570 transitions. [2025-03-03 14:51:49,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 23009 states and 29570 transitions. [2025-03-03 14:51:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:51:49,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:49,130 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:51:49,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:49,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:49,330 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:49,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash -712800206, now seen corresponding path program 1 times [2025-03-03 14:51:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703341725] [2025-03-03 14:51:49,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:49,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:51:49,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:51:49,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:49,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703341725] [2025-03-03 14:51:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703341725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756560064] [2025-03-03 14:51:49,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:49,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:49,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:49,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:49,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:51:49,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:51:49,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:51:49,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:49,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:49,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 14:51:49,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:58,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756560064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:03,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27, 30] total 65 [2025-03-03 14:52:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758359171] [2025-03-03 14:52:03,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-03 14:52:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:03,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-03 14:52:03,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=3547, Unknown=0, NotChecked=0, Total=4160 [2025-03-03 14:52:03,645 INFO L87 Difference]: Start difference. First operand 23009 states and 29570 transitions. Second operand has 65 states, 65 states have (on average 3.723076923076923) internal successors, (242), 65 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:36,882 INFO L93 Difference]: Finished difference Result 63556 states and 81644 transitions. [2025-03-03 14:52:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2025-03-03 14:52:36,883 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.723076923076923) internal successors, (242), 65 states have internal predecessors, (242), 0 states have call successors, (0), 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 14:52:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:36,941 INFO L225 Difference]: With dead ends: 63556 [2025-03-03 14:52:36,941 INFO L226 Difference]: Without dead ends: 52942 [2025-03-03 14:52:36,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14116 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=7210, Invalid=30620, Unknown=0, NotChecked=0, Total=37830 [2025-03-03 14:52:36,959 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 3489 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 4587 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3489 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 4688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:36,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 2457 Invalid, 4688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4587 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 14:52:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52942 states. [2025-03-03 14:52:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52942 to 24798. [2025-03-03 14:52:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24798 states, 24797 states have (on average 1.2833407267008106) internal successors, (31823), 24797 states have internal predecessors, (31823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24798 states to 24798 states and 31823 transitions. [2025-03-03 14:52:37,937 INFO L78 Accepts]: Start accepts. Automaton has 24798 states and 31823 transitions. Word has length 91 [2025-03-03 14:52:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:37,937 INFO L471 AbstractCegarLoop]: Abstraction has 24798 states and 31823 transitions. [2025-03-03 14:52:37,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.723076923076923) internal successors, (242), 65 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 24798 states and 31823 transitions. [2025-03-03 14:52:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:52:37,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:37,939 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:52:37,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:52:38,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 14:52:38,139 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:38,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash -224777448, now seen corresponding path program 1 times [2025-03-03 14:52:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:38,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428060501] [2025-03-03 14:52:38,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:38,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:38,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:52:38,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:52:38,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:38,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:39,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428060501] [2025-03-03 14:52:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428060501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618737445] [2025-03-03 14:52:39,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:39,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:39,839 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:52:39,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:52:39,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:52:39,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:52:39,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:39,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:39,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:52:39,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:40,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618737445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:40,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 6] total 38 [2025-03-03 14:52:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425402070] [2025-03-03 14:52:40,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:40,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 14:52:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:40,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 14:52:40,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1276, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 14:52:40,449 INFO L87 Difference]: Start difference. First operand 24798 states and 31823 transitions. Second operand has 38 states, 38 states have (on average 6.947368421052632) internal successors, (264), 38 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)