./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0df39af5bb0da8e3087f1622629197ff07999529140b31d9eb8577cc8820a051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:44:01,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:44:01,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:44:01,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:44:01,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:44:01,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:44:01,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:44:01,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:44:01,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:44:01,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:44:01,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:44:01,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:44:01,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:44:01,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:44:01,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:44:01,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:01,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:01,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:44:01,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:44:01,957 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-jdk21/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 -> 0df39af5bb0da8e3087f1622629197ff07999529140b31d9eb8577cc8820a051 [2025-01-09 04:44:02,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:44:02,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:44:02,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:44:02,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:44:02,246 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:44:02,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:44:03,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487b2e047/8a4670b760bc42acb3079c7d7e1ff12f/FLAG3d984e9ad [2025-01-09 04:44:03,694 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:44:03,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:44:03,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487b2e047/8a4670b760bc42acb3079c7d7e1ff12f/FLAG3d984e9ad [2025-01-09 04:44:03,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/487b2e047/8a4670b760bc42acb3079c7d7e1ff12f [2025-01-09 04:44:03,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:44:03,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:44:03,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:44:03,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:44:03,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:44:03,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:03" (1/1) ... [2025-01-09 04:44:03,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173f01ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:03, skipping insertion in model container [2025-01-09 04:44:03,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:03" (1/1) ... [2025-01-09 04:44:03,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:44:03,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7105,7118] [2025-01-09 04:44:03,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:44:03,991 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:44:04,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7105,7118] [2025-01-09 04:44:04,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:44:04,076 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:44:04,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04 WrapperNode [2025-01-09 04:44:04,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:44:04,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:44:04,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:44:04,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:44:04,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,141 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 721 [2025-01-09 04:44:04,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:44:04,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:44:04,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:44:04,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:44:04,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,174 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-01-09 04:44:04,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:44:04,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:44:04,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:44:04,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:44:04,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (1/1) ... [2025-01-09 04:44:04,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:44:04,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:04,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:44:04,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:44:04,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:44:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:44:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:44:04,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:44:04,351 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:44:04,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:44:04,845 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-09 04:44:04,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:44:04,854 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:44:04,854 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:44:04,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:04 BoogieIcfgContainer [2025-01-09 04:44:04,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:44:04,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:44:04,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:44:04,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:44:04,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:44:03" (1/3) ... [2025-01-09 04:44:04,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3eaa5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:04, skipping insertion in model container [2025-01-09 04:44:04,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:04" (2/3) ... [2025-01-09 04:44:04,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3eaa5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:04, skipping insertion in model container [2025-01-09 04:44:04,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:04" (3/3) ... [2025-01-09 04:44:04,862 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:44:04,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:44:04,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 179 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:44:04,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:44:04,928 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;@169d4c5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:44:04,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:44:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:44:04,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:04,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:04,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash -113151096, now seen corresponding path program 1 times [2025-01-09 04:44:04,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:04,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286079021] [2025-01-09 04:44:04,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:05,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:44:05,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:44:05,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:05,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286079021] [2025-01-09 04:44:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286079021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:05,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:05,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257573447] [2025-01-09 04:44:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:05,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:05,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:05,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:05,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:05,432 INFO L87 Difference]: Start difference. First operand has 179 states, 177 states have (on average 1.7175141242937852) internal successors, (304), 178 states have internal predecessors, (304), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:05,602 INFO L93 Difference]: Finished difference Result 639 states and 1034 transitions. [2025-01-09 04:44:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-01-09 04:44:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:05,612 INFO L225 Difference]: With dead ends: 639 [2025-01-09 04:44:05,612 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 04:44:05,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:05,617 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 1598 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:05,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 1127 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 04:44:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 274. [2025-01-09 04:44:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.5128205128205128) internal successors, (413), 273 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 413 transitions. [2025-01-09 04:44:05,657 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 413 transitions. Word has length 64 [2025-01-09 04:44:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:05,657 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 413 transitions. [2025-01-09 04:44:05,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 413 transitions. [2025-01-09 04:44:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:44:05,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:05,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:05,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:44:05,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:05,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 507394196, now seen corresponding path program 1 times [2025-01-09 04:44:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:05,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540619362] [2025-01-09 04:44:05,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:05,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:44:05,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:44:05,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:05,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:05,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:05,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540619362] [2025-01-09 04:44:05,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540619362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:05,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:05,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:05,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527092883] [2025-01-09 04:44:05,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:05,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:05,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:05,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:05,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:05,937 INFO L87 Difference]: Start difference. First operand 274 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:06,061 INFO L93 Difference]: Finished difference Result 1012 states and 1565 transitions. [2025-01-09 04:44:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-01-09 04:44:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:06,065 INFO L225 Difference]: With dead ends: 1012 [2025-01-09 04:44:06,067 INFO L226 Difference]: Without dead ends: 800 [2025-01-09 04:44:06,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:06,070 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1012 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:06,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 895 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-09 04:44:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 794. [2025-01-09 04:44:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.5359394703656999) internal successors, (1218), 793 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1218 transitions. [2025-01-09 04:44:06,119 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1218 transitions. Word has length 65 [2025-01-09 04:44:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:06,119 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1218 transitions. [2025-01-09 04:44:06,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1218 transitions. [2025-01-09 04:44:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:44:06,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:06,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:06,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:44:06,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:06,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1175932082, now seen corresponding path program 1 times [2025-01-09 04:44:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:06,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439914231] [2025-01-09 04:44:06,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:44:06,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:44:06,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:06,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439914231] [2025-01-09 04:44:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439914231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:06,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:06,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384769913] [2025-01-09 04:44:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:06,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:06,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:06,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:06,313 INFO L87 Difference]: Start difference. First operand 794 states and 1218 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:06,500 INFO L93 Difference]: Finished difference Result 2126 states and 3304 transitions. [2025-01-09 04:44:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:44:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:06,506 INFO L225 Difference]: With dead ends: 2126 [2025-01-09 04:44:06,506 INFO L226 Difference]: Without dead ends: 1382 [2025-01-09 04:44:06,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:06,510 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1001 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:06,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 246 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-01-09 04:44:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1380. [2025-01-09 04:44:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.5453226976069616) internal successors, (2131), 1379 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2131 transitions. [2025-01-09 04:44:06,540 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2131 transitions. Word has length 66 [2025-01-09 04:44:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:06,541 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2131 transitions. [2025-01-09 04:44:06,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2131 transitions. [2025-01-09 04:44:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:44:06,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:06,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:06,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:44:06,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:06,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash 195420080, now seen corresponding path program 1 times [2025-01-09 04:44:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:06,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574233392] [2025-01-09 04:44:06,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:06,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:44:06,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:44:06,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:06,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574233392] [2025-01-09 04:44:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574233392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:06,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:06,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041123537] [2025-01-09 04:44:06,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:06,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:06,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:06,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:06,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:06,678 INFO L87 Difference]: Start difference. First operand 1380 states and 2131 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:06,887 INFO L93 Difference]: Finished difference Result 3712 states and 5789 transitions. [2025-01-09 04:44:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:06,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:44:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:06,896 INFO L225 Difference]: With dead ends: 3712 [2025-01-09 04:44:06,897 INFO L226 Difference]: Without dead ends: 2432 [2025-01-09 04:44:06,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:06,904 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 927 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:06,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 252 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2025-01-09 04:44:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2430. [2025-01-09 04:44:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 1.550020584602717) internal successors, (3765), 2429 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3765 transitions. [2025-01-09 04:44:06,942 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3765 transitions. Word has length 66 [2025-01-09 04:44:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:06,942 INFO L471 AbstractCegarLoop]: Abstraction has 2430 states and 3765 transitions. [2025-01-09 04:44:06,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3765 transitions. [2025-01-09 04:44:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:44:06,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:06,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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:06,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:44:06,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:06,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2140991135, now seen corresponding path program 1 times [2025-01-09 04:44:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:06,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703680945] [2025-01-09 04:44:06,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:06,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:44:06,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:44:06,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:06,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:07,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703680945] [2025-01-09 04:44:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703680945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:07,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:07,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:07,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088625033] [2025-01-09 04:44:07,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:07,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:07,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:07,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:07,030 INFO L87 Difference]: Start difference. First operand 2430 states and 3765 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:07,217 INFO L93 Difference]: Finished difference Result 6933 states and 10800 transitions. [2025-01-09 04:44:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:44:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:07,231 INFO L225 Difference]: With dead ends: 6933 [2025-01-09 04:44:07,231 INFO L226 Difference]: Without dead ends: 4576 [2025-01-09 04:44:07,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:07,235 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 953 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:07,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 250 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-01-09 04:44:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4574. [2025-01-09 04:44:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 4573 states have (on average 1.5484364749617319) internal successors, (7081), 4573 states have internal predecessors, (7081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 7081 transitions. [2025-01-09 04:44:07,346 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 7081 transitions. Word has length 66 [2025-01-09 04:44:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:07,347 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 7081 transitions. [2025-01-09 04:44:07,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 7081 transitions. [2025-01-09 04:44:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:44:07,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:07,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:07,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:44:07,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:07,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -472666691, now seen corresponding path program 1 times [2025-01-09 04:44:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:07,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696723616] [2025-01-09 04:44:07,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:07,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:44:07,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:44:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:07,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:07,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696723616] [2025-01-09 04:44:07,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696723616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:07,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:07,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273073872] [2025-01-09 04:44:07,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:07,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:07,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:07,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:07,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:07,438 INFO L87 Difference]: Start difference. First operand 4574 states and 7081 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:07,643 INFO L93 Difference]: Finished difference Result 12540 states and 19466 transitions. [2025-01-09 04:44:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:07,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:44:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:07,664 INFO L225 Difference]: With dead ends: 12540 [2025-01-09 04:44:07,665 INFO L226 Difference]: Without dead ends: 8000 [2025-01-09 04:44:07,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:07,711 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1015 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:07,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 244 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2025-01-09 04:44:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 7998. [2025-01-09 04:44:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7998 states, 7997 states have (on average 1.5390771539327248) internal successors, (12308), 7997 states have internal predecessors, (12308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7998 states to 7998 states and 12308 transitions. [2025-01-09 04:44:07,843 INFO L78 Accepts]: Start accepts. Automaton has 7998 states and 12308 transitions. Word has length 66 [2025-01-09 04:44:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:07,843 INFO L471 AbstractCegarLoop]: Abstraction has 7998 states and 12308 transitions. [2025-01-09 04:44:07,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7998 states and 12308 transitions. [2025-01-09 04:44:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:44:07,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:07,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:07,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:44:07,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:07,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash 545251456, now seen corresponding path program 1 times [2025-01-09 04:44:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82019813] [2025-01-09 04:44:07,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:44:07,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:44:07,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:07,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82019813] [2025-01-09 04:44:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82019813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:08,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:08,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:44:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107847090] [2025-01-09 04:44:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:44:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:08,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:44:08,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:08,085 INFO L87 Difference]: Start difference. First operand 7998 states and 12308 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-01-09 04:44:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:08,115 INFO L93 Difference]: Finished difference Result 8224 states and 12645 transitions. [2025-01-09 04:44:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 67 [2025-01-09 04:44:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:08,139 INFO L225 Difference]: With dead ends: 8224 [2025-01-09 04:44:08,139 INFO L226 Difference]: Without dead ends: 8222 [2025-01-09 04:44:08,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:08,144 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:08,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 970 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2025-01-09 04:44:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 8222. [2025-01-09 04:44:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8222 states, 8221 states have (on average 1.5243887604914244) internal successors, (12532), 8221 states have internal predecessors, (12532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8222 states to 8222 states and 12532 transitions. [2025-01-09 04:44:08,266 INFO L78 Accepts]: Start accepts. Automaton has 8222 states and 12532 transitions. Word has length 67 [2025-01-09 04:44:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:08,266 INFO L471 AbstractCegarLoop]: Abstraction has 8222 states and 12532 transitions. [2025-01-09 04:44:08,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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-01-09 04:44:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 8222 states and 12532 transitions. [2025-01-09 04:44:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:08,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:08,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:08,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:44:08,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2333062, now seen corresponding path program 1 times [2025-01-09 04:44:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:08,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923582515] [2025-01-09 04:44:08,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:08,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:08,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:08,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:08,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923582515] [2025-01-09 04:44:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923582515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:44:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393481978] [2025-01-09 04:44:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:44:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:08,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:44:08,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:44:08,522 INFO L87 Difference]: Start difference. First operand 8222 states and 12532 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:09,047 INFO L93 Difference]: Finished difference Result 18060 states and 27327 transitions. [2025-01-09 04:44:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:44:09,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 04:44:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:09,069 INFO L225 Difference]: With dead ends: 18060 [2025-01-09 04:44:09,069 INFO L226 Difference]: Without dead ends: 12246 [2025-01-09 04:44:09,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:44:09,078 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1149 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:09,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 778 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12246 states. [2025-01-09 04:44:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12246 to 8355. [2025-01-09 04:44:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8355 states, 8354 states have (on average 1.5210677519751017) internal successors, (12707), 8354 states have internal predecessors, (12707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 12707 transitions. [2025-01-09 04:44:09,226 INFO L78 Accepts]: Start accepts. Automaton has 8355 states and 12707 transitions. Word has length 68 [2025-01-09 04:44:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:09,227 INFO L471 AbstractCegarLoop]: Abstraction has 8355 states and 12707 transitions. [2025-01-09 04:44:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 8355 states and 12707 transitions. [2025-01-09 04:44:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:09,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:09,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:09,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:44:09,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:09,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash -371480250, now seen corresponding path program 1 times [2025-01-09 04:44:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618146069] [2025-01-09 04:44:09,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:09,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:09,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:09,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:09,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618146069] [2025-01-09 04:44:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618146069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:09,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:09,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:44:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352823982] [2025-01-09 04:44:09,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:09,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:44:09,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:09,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:44:09,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:44:09,591 INFO L87 Difference]: Start difference. First operand 8355 states and 12707 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:10,176 INFO L93 Difference]: Finished difference Result 13727 states and 20750 transitions. [2025-01-09 04:44:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:44:10,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 04:44:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:10,199 INFO L225 Difference]: With dead ends: 13727 [2025-01-09 04:44:10,199 INFO L226 Difference]: Without dead ends: 12420 [2025-01-09 04:44:10,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:44:10,207 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1079 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:10,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 922 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2025-01-09 04:44:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 8355. [2025-01-09 04:44:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8355 states, 8354 states have (on average 1.5208283457026575) internal successors, (12705), 8354 states have internal predecessors, (12705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 12705 transitions. [2025-01-09 04:44:10,380 INFO L78 Accepts]: Start accepts. Automaton has 8355 states and 12705 transitions. Word has length 68 [2025-01-09 04:44:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:10,381 INFO L471 AbstractCegarLoop]: Abstraction has 8355 states and 12705 transitions. [2025-01-09 04:44:10,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 8355 states and 12705 transitions. [2025-01-09 04:44:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:10,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:10,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:10,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:44:10,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:10,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2100624742, now seen corresponding path program 1 times [2025-01-09 04:44:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908837657] [2025-01-09 04:44:10,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908837657] [2025-01-09 04:44:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908837657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:10,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:44:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594551666] [2025-01-09 04:44:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:10,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:44:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:10,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:44:10,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:44:10,584 INFO L87 Difference]: Start difference. First operand 8355 states and 12705 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:11,086 INFO L93 Difference]: Finished difference Result 14891 states and 22467 transitions. [2025-01-09 04:44:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:44:11,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 04:44:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:11,105 INFO L225 Difference]: With dead ends: 14891 [2025-01-09 04:44:11,105 INFO L226 Difference]: Without dead ends: 11314 [2025-01-09 04:44:11,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:44:11,113 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1044 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:11,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 844 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:44:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11314 states. [2025-01-09 04:44:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11314 to 8578. [2025-01-09 04:44:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8578 states, 8577 states have (on average 1.516147837239128) internal successors, (13004), 8577 states have internal predecessors, (13004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8578 states to 8578 states and 13004 transitions. [2025-01-09 04:44:11,282 INFO L78 Accepts]: Start accepts. Automaton has 8578 states and 13004 transitions. Word has length 68 [2025-01-09 04:44:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:11,282 INFO L471 AbstractCegarLoop]: Abstraction has 8578 states and 13004 transitions. [2025-01-09 04:44:11,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8578 states and 13004 transitions. [2025-01-09 04:44:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:44:11,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:11,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:11,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:44:11,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:11,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1059619418, now seen corresponding path program 1 times [2025-01-09 04:44:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010464829] [2025-01-09 04:44:11,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:11,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:44:11,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:44:11,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:11,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010464829] [2025-01-09 04:44:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010464829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:11,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:11,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:44:11,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731631459] [2025-01-09 04:44:11,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:11,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:44:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:11,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:44:11,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:44:11,533 INFO L87 Difference]: Start difference. First operand 8578 states and 13004 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:12,109 INFO L93 Difference]: Finished difference Result 21670 states and 32663 transitions. [2025-01-09 04:44:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:44:12,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 04:44:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:12,132 INFO L225 Difference]: With dead ends: 21670 [2025-01-09 04:44:12,132 INFO L226 Difference]: Without dead ends: 13755 [2025-01-09 04:44:12,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:44:12,143 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1178 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:12,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1029 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13755 states. [2025-01-09 04:44:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13755 to 8728. [2025-01-09 04:44:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8728 states, 8727 states have (on average 1.5092242465910393) internal successors, (13171), 8727 states have internal predecessors, (13171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8728 states to 8728 states and 13171 transitions. [2025-01-09 04:44:12,314 INFO L78 Accepts]: Start accepts. Automaton has 8728 states and 13171 transitions. Word has length 68 [2025-01-09 04:44:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:12,314 INFO L471 AbstractCegarLoop]: Abstraction has 8728 states and 13171 transitions. [2025-01-09 04:44:12,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8728 states and 13171 transitions. [2025-01-09 04:44:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:12,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:12,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:12,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:44:12,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:12,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1047773961, now seen corresponding path program 1 times [2025-01-09 04:44:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488790362] [2025-01-09 04:44:12,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:12,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:12,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:12,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:12,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488790362] [2025-01-09 04:44:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488790362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:12,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:44:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635982998] [2025-01-09 04:44:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:12,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:44:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:12,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:44:12,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:44:12,422 INFO L87 Difference]: Start difference. First operand 8728 states and 13171 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-01-09 04:44:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:12,473 INFO L93 Difference]: Finished difference Result 22788 states and 34565 transitions. [2025-01-09 04:44:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:44:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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 69 [2025-01-09 04:44:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:12,493 INFO L225 Difference]: With dead ends: 22788 [2025-01-09 04:44:12,493 INFO L226 Difference]: Without dead ends: 15138 [2025-01-09 04:44:12,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:44:12,503 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 170 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:12,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 605 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-01-09 04:44:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15032. [2025-01-09 04:44:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15032 states, 15031 states have (on average 1.4989687978178432) internal successors, (22531), 15031 states have internal predecessors, (22531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15032 states to 15032 states and 22531 transitions. [2025-01-09 04:44:12,698 INFO L78 Accepts]: Start accepts. Automaton has 15032 states and 22531 transitions. Word has length 69 [2025-01-09 04:44:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:12,698 INFO L471 AbstractCegarLoop]: Abstraction has 15032 states and 22531 transitions. [2025-01-09 04:44:12,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 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-01-09 04:44:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 15032 states and 22531 transitions. [2025-01-09 04:44:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:12,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:12,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:12,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:44:12,702 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:12,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1802228217, now seen corresponding path program 1 times [2025-01-09 04:44:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:12,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486137315] [2025-01-09 04:44:12,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:12,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:12,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:12,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486137315] [2025-01-09 04:44:12,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486137315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:12,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564881406] [2025-01-09 04:44:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:12,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:12,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:12,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:12,753 INFO L87 Difference]: Start difference. First operand 15032 states and 22531 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:12,821 INFO L93 Difference]: Finished difference Result 27396 states and 41148 transitions. [2025-01-09 04:44:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 04:44:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:12,853 INFO L225 Difference]: With dead ends: 27396 [2025-01-09 04:44:12,853 INFO L226 Difference]: Without dead ends: 18430 [2025-01-09 04:44:12,865 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-01-09 04:44:12,865 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 156 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:12,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 480 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18430 states. [2025-01-09 04:44:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18430 to 18212. [2025-01-09 04:44:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18212 states, 18211 states have (on average 1.479215858547032) internal successors, (26938), 18211 states have internal predecessors, (26938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18212 states to 18212 states and 26938 transitions. [2025-01-09 04:44:13,093 INFO L78 Accepts]: Start accepts. Automaton has 18212 states and 26938 transitions. Word has length 69 [2025-01-09 04:44:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:13,093 INFO L471 AbstractCegarLoop]: Abstraction has 18212 states and 26938 transitions. [2025-01-09 04:44:13,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 18212 states and 26938 transitions. [2025-01-09 04:44:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:13,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:13,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:13,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:44:13,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1041130329, now seen corresponding path program 1 times [2025-01-09 04:44:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:13,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963775009] [2025-01-09 04:44:13,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:13,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:13,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:13,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:13,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963775009] [2025-01-09 04:44:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963775009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841997139] [2025-01-09 04:44:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:13,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:13,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:13,143 INFO L87 Difference]: Start difference. First operand 18212 states and 26938 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:13,226 INFO L93 Difference]: Finished difference Result 40144 states and 59521 transitions. [2025-01-09 04:44:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 04:44:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:13,269 INFO L225 Difference]: With dead ends: 40144 [2025-01-09 04:44:13,269 INFO L226 Difference]: Without dead ends: 24348 [2025-01-09 04:44:13,289 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-01-09 04:44:13,290 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 175 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:13,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 464 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24348 states. [2025-01-09 04:44:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24348 to 24282. [2025-01-09 04:44:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24282 states, 24281 states have (on average 1.4636958939088176) internal successors, (35540), 24281 states have internal predecessors, (35540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24282 states to 24282 states and 35540 transitions. [2025-01-09 04:44:13,636 INFO L78 Accepts]: Start accepts. Automaton has 24282 states and 35540 transitions. Word has length 69 [2025-01-09 04:44:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:13,636 INFO L471 AbstractCegarLoop]: Abstraction has 24282 states and 35540 transitions. [2025-01-09 04:44:13,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 24282 states and 35540 transitions. [2025-01-09 04:44:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:13,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:13,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:13,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:44:13,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:13,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash -933815240, now seen corresponding path program 1 times [2025-01-09 04:44:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:13,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233479292] [2025-01-09 04:44:13,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:13,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:13,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:13,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:13,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:13,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233479292] [2025-01-09 04:44:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233479292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:13,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:13,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657953954] [2025-01-09 04:44:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:13,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:13,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:13,678 INFO L87 Difference]: Start difference. First operand 24282 states and 35540 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:13,749 INFO L93 Difference]: Finished difference Result 33907 states and 49406 transitions. [2025-01-09 04:44:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:13,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 04:44:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:13,783 INFO L225 Difference]: With dead ends: 33907 [2025-01-09 04:44:13,783 INFO L226 Difference]: Without dead ends: 24823 [2025-01-09 04:44:13,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-01-09 04:44:13,799 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 143 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:13,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 464 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24823 states. [2025-01-09 04:44:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24823 to 22225. [2025-01-09 04:44:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22225 states, 22224 states have (on average 1.4353401727861772) internal successors, (31899), 22224 states have internal predecessors, (31899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22225 states to 22225 states and 31899 transitions. [2025-01-09 04:44:14,176 INFO L78 Accepts]: Start accepts. Automaton has 22225 states and 31899 transitions. Word has length 69 [2025-01-09 04:44:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:14,176 INFO L471 AbstractCegarLoop]: Abstraction has 22225 states and 31899 transitions. [2025-01-09 04:44:14,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22225 states and 31899 transitions. [2025-01-09 04:44:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:44:14,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:14,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:44:14,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 804290264, now seen corresponding path program 1 times [2025-01-09 04:44:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907660752] [2025-01-09 04:44:14,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:14,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:44:14,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:44:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:14,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907660752] [2025-01-09 04:44:14,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907660752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:14,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:14,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:14,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561812215] [2025-01-09 04:44:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:14,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:14,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:14,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:14,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:14,226 INFO L87 Difference]: Start difference. First operand 22225 states and 31899 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:14,501 INFO L93 Difference]: Finished difference Result 44870 states and 64241 transitions. [2025-01-09 04:44:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 04:44:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:14,545 INFO L225 Difference]: With dead ends: 44870 [2025-01-09 04:44:14,545 INFO L226 Difference]: Without dead ends: 25148 [2025-01-09 04:44:14,557 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-01-09 04:44:14,558 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 161 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:14,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 554 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25148 states. [2025-01-09 04:44:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25148 to 24902. [2025-01-09 04:44:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24902 states, 24901 states have (on average 1.398417734227541) internal successors, (34822), 24901 states have internal predecessors, (34822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24902 states to 24902 states and 34822 transitions. [2025-01-09 04:44:14,926 INFO L78 Accepts]: Start accepts. Automaton has 24902 states and 34822 transitions. Word has length 69 [2025-01-09 04:44:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:14,926 INFO L471 AbstractCegarLoop]: Abstraction has 24902 states and 34822 transitions. [2025-01-09 04:44:14,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-01-09 04:44:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 24902 states and 34822 transitions. [2025-01-09 04:44:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:14,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:14,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:14,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:44:14,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:14,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash -77781245, now seen corresponding path program 1 times [2025-01-09 04:44:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:14,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61696912] [2025-01-09 04:44:14,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:14,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:14,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:14,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:14,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61696912] [2025-01-09 04:44:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61696912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147564182] [2025-01-09 04:44:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:15,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:15,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:15,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:15,043 INFO L87 Difference]: Start difference. First operand 24902 states and 34822 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:15,252 INFO L93 Difference]: Finished difference Result 52991 states and 74773 transitions. [2025-01-09 04:44:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:15,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-01-09 04:44:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:15,305 INFO L225 Difference]: With dead ends: 52991 [2025-01-09 04:44:15,305 INFO L226 Difference]: Without dead ends: 42897 [2025-01-09 04:44:15,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:15,325 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1083 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:15,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1133 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42897 states. [2025-01-09 04:44:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42897 to 34310. [2025-01-09 04:44:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34310 states, 34309 states have (on average 1.398787490162931) internal successors, (47991), 34309 states have internal predecessors, (47991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34310 states to 34310 states and 47991 transitions. [2025-01-09 04:44:15,940 INFO L78 Accepts]: Start accepts. Automaton has 34310 states and 47991 transitions. Word has length 70 [2025-01-09 04:44:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:15,940 INFO L471 AbstractCegarLoop]: Abstraction has 34310 states and 47991 transitions. [2025-01-09 04:44:15,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 34310 states and 47991 transitions. [2025-01-09 04:44:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:15,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:15,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:15,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:44:15,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1497723701, now seen corresponding path program 1 times [2025-01-09 04:44:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673927156] [2025-01-09 04:44:15,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:15,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:15,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:15,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:15,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673927156] [2025-01-09 04:44:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673927156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242667298] [2025-01-09 04:44:16,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:16,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:16,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:16,033 INFO L87 Difference]: Start difference. First operand 34310 states and 47991 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:16,241 INFO L93 Difference]: Finished difference Result 52476 states and 73830 transitions. [2025-01-09 04:44:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-01-09 04:44:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:16,586 INFO L225 Difference]: With dead ends: 52476 [2025-01-09 04:44:16,586 INFO L226 Difference]: Without dead ends: 49486 [2025-01-09 04:44:16,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:16,603 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1105 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:16,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 1210 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49486 states. [2025-01-09 04:44:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49486 to 37253. [2025-01-09 04:44:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37253 states, 37252 states have (on average 1.3991731987544294) internal successors, (52122), 37252 states have internal predecessors, (52122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37253 states to 37253 states and 52122 transitions. [2025-01-09 04:44:17,240 INFO L78 Accepts]: Start accepts. Automaton has 37253 states and 52122 transitions. Word has length 70 [2025-01-09 04:44:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:17,240 INFO L471 AbstractCegarLoop]: Abstraction has 37253 states and 52122 transitions. [2025-01-09 04:44:17,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37253 states and 52122 transitions. [2025-01-09 04:44:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:17,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:17,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:17,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:44:17,244 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:17,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1024658010, now seen corresponding path program 1 times [2025-01-09 04:44:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:17,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199797318] [2025-01-09 04:44:17,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:17,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:17,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:17,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:17,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:17,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:17,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199797318] [2025-01-09 04:44:17,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199797318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:17,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:17,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258552012] [2025-01-09 04:44:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:17,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:17,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:17,403 INFO L87 Difference]: Start difference. First operand 37253 states and 52122 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:17,566 INFO L93 Difference]: Finished difference Result 58967 states and 82997 transitions. [2025-01-09 04:44:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-01-09 04:44:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:17,625 INFO L225 Difference]: With dead ends: 58967 [2025-01-09 04:44:17,626 INFO L226 Difference]: Without dead ends: 52353 [2025-01-09 04:44:17,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:17,646 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1031 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:17,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1336 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52353 states. [2025-01-09 04:44:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52353 to 41438. [2025-01-09 04:44:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41438 states, 41437 states have (on average 1.401187344643676) internal successors, (58061), 41437 states have internal predecessors, (58061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41438 states to 41438 states and 58061 transitions. [2025-01-09 04:44:18,337 INFO L78 Accepts]: Start accepts. Automaton has 41438 states and 58061 transitions. Word has length 70 [2025-01-09 04:44:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:18,339 INFO L471 AbstractCegarLoop]: Abstraction has 41438 states and 58061 transitions. [2025-01-09 04:44:18,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 41438 states and 58061 transitions. [2025-01-09 04:44:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:44:18,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:18,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:18,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:44:18,342 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:18,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1354981296, now seen corresponding path program 1 times [2025-01-09 04:44:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590397760] [2025-01-09 04:44:18,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:18,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:44:18,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:44:18,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:18,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:18,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590397760] [2025-01-09 04:44:18,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590397760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:18,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:18,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939611383] [2025-01-09 04:44:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:44:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:18,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:44:18,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:44:18,422 INFO L87 Difference]: Start difference. First operand 41438 states and 58061 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:18,619 INFO L93 Difference]: Finished difference Result 71179 states and 100265 transitions. [2025-01-09 04:44:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:44:18,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-01-09 04:44:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:18,689 INFO L225 Difference]: With dead ends: 71179 [2025-01-09 04:44:18,690 INFO L226 Difference]: Without dead ends: 60738 [2025-01-09 04:44:18,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:44:18,716 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1087 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:18,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1308 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:44:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60738 states. [2025-01-09 04:44:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60738 to 45936. [2025-01-09 04:44:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45936 states, 45935 states have (on average 1.4016327419179275) internal successors, (64384), 45935 states have internal predecessors, (64384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45936 states to 45936 states and 64384 transitions. [2025-01-09 04:44:19,827 INFO L78 Accepts]: Start accepts. Automaton has 45936 states and 64384 transitions. Word has length 70 [2025-01-09 04:44:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:19,827 INFO L471 AbstractCegarLoop]: Abstraction has 45936 states and 64384 transitions. [2025-01-09 04:44:19,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 45936 states and 64384 transitions. [2025-01-09 04:44:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:44:19,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:19,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:19,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:44:19,831 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:19,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash 143463778, now seen corresponding path program 1 times [2025-01-09 04:44:19,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:19,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716751662] [2025-01-09 04:44:19,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:19,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:19,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:44:19,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:44:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716751662] [2025-01-09 04:44:19,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716751662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:19,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057822066] [2025-01-09 04:44:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:19,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:19,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:19,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:19,933 INFO L87 Difference]: Start difference. First operand 45936 states and 64384 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:20,702 INFO L93 Difference]: Finished difference Result 143737 states and 201008 transitions. [2025-01-09 04:44:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:20,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-01-09 04:44:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:20,885 INFO L225 Difference]: With dead ends: 143737 [2025-01-09 04:44:20,885 INFO L226 Difference]: Without dead ends: 121279 [2025-01-09 04:44:20,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:20,940 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1766 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:20,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 470 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121279 states. [2025-01-09 04:44:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121279 to 46040. [2025-01-09 04:44:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46040 states, 46039 states have (on average 1.401181606898499) internal successors, (64509), 46039 states have internal predecessors, (64509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46040 states to 46040 states and 64509 transitions. [2025-01-09 04:44:22,175 INFO L78 Accepts]: Start accepts. Automaton has 46040 states and 64509 transitions. Word has length 75 [2025-01-09 04:44:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:22,175 INFO L471 AbstractCegarLoop]: Abstraction has 46040 states and 64509 transitions. [2025-01-09 04:44:22,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 46040 states and 64509 transitions. [2025-01-09 04:44:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:44:22,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:22,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:22,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:44:22,178 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:22,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1189070444, now seen corresponding path program 1 times [2025-01-09 04:44:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:22,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369880889] [2025-01-09 04:44:22,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:22,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:44:22,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:44:22,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:22,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:22,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369880889] [2025-01-09 04:44:22,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369880889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:22,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:22,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:22,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720554822] [2025-01-09 04:44:22,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:22,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:22,261 INFO L87 Difference]: Start difference. First operand 46040 states and 64509 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:22,847 INFO L93 Difference]: Finished difference Result 136035 states and 189173 transitions. [2025-01-09 04:44:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-01-09 04:44:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:23,021 INFO L225 Difference]: With dead ends: 136035 [2025-01-09 04:44:23,021 INFO L226 Difference]: Without dead ends: 119005 [2025-01-09 04:44:23,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:23,068 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1539 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:23,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 475 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119005 states. [2025-01-09 04:44:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119005 to 46202. [2025-01-09 04:44:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46202 states, 46201 states have (on average 1.400445877794853) internal successors, (64702), 46201 states have internal predecessors, (64702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46202 states to 46202 states and 64702 transitions. [2025-01-09 04:44:24,501 INFO L78 Accepts]: Start accepts. Automaton has 46202 states and 64702 transitions. Word has length 75 [2025-01-09 04:44:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:24,501 INFO L471 AbstractCegarLoop]: Abstraction has 46202 states and 64702 transitions. [2025-01-09 04:44:24,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 46202 states and 64702 transitions. [2025-01-09 04:44:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:44:24,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:24,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:24,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:44:24,505 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -95030964, now seen corresponding path program 1 times [2025-01-09 04:44:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518351897] [2025-01-09 04:44:24,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:24,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:44:24,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:44:24,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:24,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:24,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:24,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518351897] [2025-01-09 04:44:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518351897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:24,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:24,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663044775] [2025-01-09 04:44:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:24,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:24,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:24,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:24,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:24,582 INFO L87 Difference]: Start difference. First operand 46202 states and 64702 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:25,041 INFO L93 Difference]: Finished difference Result 114378 states and 159317 transitions. [2025-01-09 04:44:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-01-09 04:44:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:25,140 INFO L225 Difference]: With dead ends: 114378 [2025-01-09 04:44:25,141 INFO L226 Difference]: Without dead ends: 87150 [2025-01-09 04:44:25,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:25,180 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1254 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:25,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 396 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87150 states. [2025-01-09 04:44:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87150 to 46252. [2025-01-09 04:44:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46252 states, 46251 states have (on average 1.4002291842338543) internal successors, (64762), 46251 states have internal predecessors, (64762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 64762 transitions. [2025-01-09 04:44:26,095 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 64762 transitions. Word has length 75 [2025-01-09 04:44:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:26,095 INFO L471 AbstractCegarLoop]: Abstraction has 46252 states and 64762 transitions. [2025-01-09 04:44:26,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 64762 transitions. [2025-01-09 04:44:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:44:26,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:26,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:26,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:44:26,099 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2062889360, now seen corresponding path program 1 times [2025-01-09 04:44:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344041380] [2025-01-09 04:44:26,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:26,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:44:26,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:44:26,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:26,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344041380] [2025-01-09 04:44:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344041380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:44:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332422412] [2025-01-09 04:44:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:44:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:26,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:44:26,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:44:26,216 INFO L87 Difference]: Start difference. First operand 46252 states and 64762 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:27,107 INFO L93 Difference]: Finished difference Result 108737 states and 150767 transitions. [2025-01-09 04:44:27,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:44:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-01-09 04:44:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:27,233 INFO L225 Difference]: With dead ends: 108737 [2025-01-09 04:44:27,233 INFO L226 Difference]: Without dead ends: 99939 [2025-01-09 04:44:27,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:44:27,250 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1439 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:27,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 443 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99939 states. [2025-01-09 04:44:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99939 to 46501. [2025-01-09 04:44:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46501 states, 46500 states have (on average 1.3989677419354838) internal successors, (65052), 46500 states have internal predecessors, (65052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46501 states to 46501 states and 65052 transitions. [2025-01-09 04:44:28,158 INFO L78 Accepts]: Start accepts. Automaton has 46501 states and 65052 transitions. Word has length 75 [2025-01-09 04:44:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:28,158 INFO L471 AbstractCegarLoop]: Abstraction has 46501 states and 65052 transitions. [2025-01-09 04:44:28,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 46501 states and 65052 transitions. [2025-01-09 04:44:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:44:28,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:28,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:28,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:44:28,164 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:28,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 294775424, now seen corresponding path program 1 times [2025-01-09 04:44:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903089989] [2025-01-09 04:44:28,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:44:28,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:44:28,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:28,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:28,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903089989] [2025-01-09 04:44:28,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903089989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:28,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:28,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 04:44:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922307271] [2025-01-09 04:44:28,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:28,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:44:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:28,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:44:28,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:44:28,817 INFO L87 Difference]: Start difference. First operand 46501 states and 65052 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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-01-09 04:44:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:30,208 INFO L93 Difference]: Finished difference Result 140108 states and 195562 transitions. [2025-01-09 04:44:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:44:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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 77 [2025-01-09 04:44:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:30,375 INFO L225 Difference]: With dead ends: 140108 [2025-01-09 04:44:30,375 INFO L226 Difference]: Without dead ends: 134166 [2025-01-09 04:44:30,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:44:30,411 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 1928 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:30,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 2711 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134166 states. [2025-01-09 04:44:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134166 to 46514. [2025-01-09 04:44:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46514 states, 46513 states have (on average 1.3987057381807237) internal successors, (65058), 46513 states have internal predecessors, (65058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46514 states to 46514 states and 65058 transitions. [2025-01-09 04:44:31,498 INFO L78 Accepts]: Start accepts. Automaton has 46514 states and 65058 transitions. Word has length 77 [2025-01-09 04:44:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:31,498 INFO L471 AbstractCegarLoop]: Abstraction has 46514 states and 65058 transitions. [2025-01-09 04:44:31,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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-01-09 04:44:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 46514 states and 65058 transitions. [2025-01-09 04:44:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:44:31,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:31,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:31,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:44:31,503 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:31,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1091243400, now seen corresponding path program 1 times [2025-01-09 04:44:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:31,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560191675] [2025-01-09 04:44:31,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:31,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:44:31,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:44:31,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:31,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:31,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560191675] [2025-01-09 04:44:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560191675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:31,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:44:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512282182] [2025-01-09 04:44:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:44:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:31,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:44:31,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:44:31,952 INFO L87 Difference]: Start difference. First operand 46514 states and 65058 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-01-09 04:44:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:32,888 INFO L93 Difference]: Finished difference Result 107839 states and 151152 transitions. [2025-01-09 04:44:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:44:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 77 [2025-01-09 04:44:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:32,990 INFO L225 Difference]: With dead ends: 107839 [2025-01-09 04:44:32,990 INFO L226 Difference]: Without dead ends: 88210 [2025-01-09 04:44:33,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:44:33,012 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 1497 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:33,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1965 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88210 states. [2025-01-09 04:44:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88210 to 46417. [2025-01-09 04:44:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46417 states, 46416 states have (on average 1.3990434332988624) internal successors, (64938), 46416 states have internal predecessors, (64938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46417 states to 46417 states and 64938 transitions. [2025-01-09 04:44:33,799 INFO L78 Accepts]: Start accepts. Automaton has 46417 states and 64938 transitions. Word has length 77 [2025-01-09 04:44:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:33,799 INFO L471 AbstractCegarLoop]: Abstraction has 46417 states and 64938 transitions. [2025-01-09 04:44:33,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-01-09 04:44:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46417 states and 64938 transitions. [2025-01-09 04:44:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:44:33,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:33,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:33,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:44:33,805 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:33,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash -571773518, now seen corresponding path program 1 times [2025-01-09 04:44:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:33,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662054853] [2025-01-09 04:44:33,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:33,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:44:33,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:44:33,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:33,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:33,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662054853] [2025-01-09 04:44:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662054853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:33,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:33,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407954709] [2025-01-09 04:44:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:33,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:33,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:33,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:33,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:33,849 INFO L87 Difference]: Start difference. First operand 46417 states and 64938 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-01-09 04:44:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:34,177 INFO L93 Difference]: Finished difference Result 101603 states and 142436 transitions. [2025-01-09 04:44:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:34,177 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-01-09 04:44:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:34,279 INFO L225 Difference]: With dead ends: 101603 [2025-01-09 04:44:34,280 INFO L226 Difference]: Without dead ends: 73511 [2025-01-09 04:44:34,319 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-01-09 04:44:34,319 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 199 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:34,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 373 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73511 states. [2025-01-09 04:44:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73511 to 73365. [2025-01-09 04:44:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73365 states, 73364 states have (on average 1.4010822746851317) internal successors, (102789), 73364 states have internal predecessors, (102789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73365 states to 73365 states and 102789 transitions. [2025-01-09 04:44:35,489 INFO L78 Accepts]: Start accepts. Automaton has 73365 states and 102789 transitions. Word has length 78 [2025-01-09 04:44:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:35,489 INFO L471 AbstractCegarLoop]: Abstraction has 73365 states and 102789 transitions. [2025-01-09 04:44:35,490 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-01-09 04:44:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73365 states and 102789 transitions. [2025-01-09 04:44:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:44:35,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:35,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:44:35,495 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:35,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash 698644110, now seen corresponding path program 1 times [2025-01-09 04:44:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673361527] [2025-01-09 04:44:35,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:44:35,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:44:35,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:35,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673361527] [2025-01-09 04:44:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673361527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:35,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:35,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764808603] [2025-01-09 04:44:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:35,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:35,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:35,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:35,529 INFO L87 Difference]: Start difference. First operand 73365 states and 102789 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-01-09 04:44:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:35,911 INFO L93 Difference]: Finished difference Result 156418 states and 219206 transitions. [2025-01-09 04:44:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:35,912 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-01-09 04:44:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:36,077 INFO L225 Difference]: With dead ends: 156418 [2025-01-09 04:44:36,077 INFO L226 Difference]: Without dead ends: 107402 [2025-01-09 04:44:36,140 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-01-09 04:44:36,141 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 183 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:36,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 423 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107402 states. [2025-01-09 04:44:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107402 to 107020. [2025-01-09 04:44:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107020 states, 107019 states have (on average 1.403890897877947) internal successors, (150243), 107019 states have internal predecessors, (150243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107020 states to 107020 states and 150243 transitions. [2025-01-09 04:44:37,797 INFO L78 Accepts]: Start accepts. Automaton has 107020 states and 150243 transitions. Word has length 78 [2025-01-09 04:44:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:37,797 INFO L471 AbstractCegarLoop]: Abstraction has 107020 states and 150243 transitions. [2025-01-09 04:44:37,797 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-01-09 04:44:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 107020 states and 150243 transitions. [2025-01-09 04:44:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:44:37,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:37,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:37,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:44:37,805 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:37,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1177967387, now seen corresponding path program 1 times [2025-01-09 04:44:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650367444] [2025-01-09 04:44:37,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:37,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:44:37,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:44:37,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:37,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650367444] [2025-01-09 04:44:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650367444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:37,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064019819] [2025-01-09 04:44:37,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:37,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:37,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:37,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:37,852 INFO L87 Difference]: Start difference. First operand 107020 states and 150243 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-01-09 04:44:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:38,203 INFO L93 Difference]: Finished difference Result 156176 states and 218738 transitions. [2025-01-09 04:44:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:38,203 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-01-09 04:44:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:38,326 INFO L225 Difference]: With dead ends: 156176 [2025-01-09 04:44:38,326 INFO L226 Difference]: Without dead ends: 93855 [2025-01-09 04:44:38,388 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-01-09 04:44:38,389 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 151 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:38,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 512 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93855 states. [2025-01-09 04:44:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93855 to 93853. [2025-01-09 04:44:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93853 states, 93852 states have (on average 1.3882602395260624) internal successors, (130291), 93852 states have internal predecessors, (130291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93853 states to 93853 states and 130291 transitions. [2025-01-09 04:44:40,391 INFO L78 Accepts]: Start accepts. Automaton has 93853 states and 130291 transitions. Word has length 81 [2025-01-09 04:44:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:40,391 INFO L471 AbstractCegarLoop]: Abstraction has 93853 states and 130291 transitions. [2025-01-09 04:44:40,391 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-01-09 04:44:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 93853 states and 130291 transitions. [2025-01-09 04:44:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:44:40,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:40,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:44:40,400 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -530886962, now seen corresponding path program 1 times [2025-01-09 04:44:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279229220] [2025-01-09 04:44:40,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:44:40,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:44:40,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:40,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:41,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279229220] [2025-01-09 04:44:41,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279229220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:41,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:41,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-01-09 04:44:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490335763] [2025-01-09 04:44:41,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:41,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:44:41,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:41,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:44:41,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:44:41,896 INFO L87 Difference]: Start difference. First operand 93853 states and 130291 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:46,511 INFO L93 Difference]: Finished difference Result 135064 states and 186686 transitions. [2025-01-09 04:44:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 04:44:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:44:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:46,707 INFO L225 Difference]: With dead ends: 135064 [2025-01-09 04:44:46,708 INFO L226 Difference]: Without dead ends: 133119 [2025-01-09 04:44:46,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=487, Invalid=2375, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 04:44:46,754 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 2538 mSDsluCounter, 6248 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2538 SdHoareTripleChecker+Valid, 6669 SdHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:46,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2538 Valid, 6669 Invalid, 4737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 04:44:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133119 states. [2025-01-09 04:44:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133119 to 93864. [2025-01-09 04:44:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93864 states, 93863 states have (on average 1.388246699977627) internal successors, (130305), 93863 states have internal predecessors, (130305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93864 states to 93864 states and 130305 transitions. [2025-01-09 04:44:48,169 INFO L78 Accepts]: Start accepts. Automaton has 93864 states and 130305 transitions. Word has length 82 [2025-01-09 04:44:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:48,169 INFO L471 AbstractCegarLoop]: Abstraction has 93864 states and 130305 transitions. [2025-01-09 04:44:48,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 93864 states and 130305 transitions. [2025-01-09 04:44:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:44:48,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:48,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:48,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:44:48,178 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:48,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:48,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1478686874, now seen corresponding path program 1 times [2025-01-09 04:44:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:48,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744524927] [2025-01-09 04:44:48,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:48,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:44:48,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:44:48,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:48,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:48,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744524927] [2025-01-09 04:44:48,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744524927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:48,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:48,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011844622] [2025-01-09 04:44:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:48,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:48,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:48,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:48,240 INFO L87 Difference]: Start difference. First operand 93864 states and 130305 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:48,960 INFO L93 Difference]: Finished difference Result 184931 states and 257090 transitions. [2025-01-09 04:44:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:44:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:49,145 INFO L225 Difference]: With dead ends: 184931 [2025-01-09 04:44:49,145 INFO L226 Difference]: Without dead ends: 130200 [2025-01-09 04:44:49,190 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-01-09 04:44:49,191 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 172 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:49,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 357 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130200 states. [2025-01-09 04:44:50,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130200 to 80996. [2025-01-09 04:44:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80996 states, 80995 states have (on average 1.3926291746404098) internal successors, (112796), 80995 states have internal predecessors, (112796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80996 states to 80996 states and 112796 transitions. [2025-01-09 04:44:50,701 INFO L78 Accepts]: Start accepts. Automaton has 80996 states and 112796 transitions. Word has length 82 [2025-01-09 04:44:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:50,701 INFO L471 AbstractCegarLoop]: Abstraction has 80996 states and 112796 transitions. [2025-01-09 04:44:50,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 80996 states and 112796 transitions. [2025-01-09 04:44:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 04:44:50,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:50,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:50,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:44:50,708 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:50,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2099480500, now seen corresponding path program 1 times [2025-01-09 04:44:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602911181] [2025-01-09 04:44:50,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:50,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 04:44:50,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 04:44:50,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:50,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602911181] [2025-01-09 04:44:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602911181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537032118] [2025-01-09 04:44:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:50,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:50,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:50,753 INFO L87 Difference]: Start difference. First operand 80996 states and 112796 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:51,511 INFO L93 Difference]: Finished difference Result 159900 states and 222916 transitions. [2025-01-09 04:44:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:51,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 04:44:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:51,632 INFO L225 Difference]: With dead ends: 159900 [2025-01-09 04:44:51,632 INFO L226 Difference]: Without dead ends: 112055 [2025-01-09 04:44:51,662 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-01-09 04:44:51,663 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 180 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:51,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 361 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112055 states. [2025-01-09 04:44:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112055 to 78930. [2025-01-09 04:44:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78930 states, 78929 states have (on average 1.3908449365885796) internal successors, (109778), 78929 states have internal predecessors, (109778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78930 states to 78930 states and 109778 transitions. [2025-01-09 04:44:52,861 INFO L78 Accepts]: Start accepts. Automaton has 78930 states and 109778 transitions. Word has length 82 [2025-01-09 04:44:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:52,862 INFO L471 AbstractCegarLoop]: Abstraction has 78930 states and 109778 transitions. [2025-01-09 04:44:52,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 78930 states and 109778 transitions. [2025-01-09 04:44:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:44:52,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:52,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:52,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:44:52,867 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:52,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2025788840, now seen corresponding path program 1 times [2025-01-09 04:44:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58222791] [2025-01-09 04:44:52,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:52,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:44:52,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:44:52,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:52,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58222791] [2025-01-09 04:44:53,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58222791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:53,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:53,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:44:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443845451] [2025-01-09 04:44:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:53,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:44:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:53,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:44:53,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:44:53,262 INFO L87 Difference]: Start difference. First operand 78930 states and 109778 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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-01-09 04:44:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:53,827 INFO L93 Difference]: Finished difference Result 129162 states and 179403 transitions. [2025-01-09 04:44:53,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:44:53,827 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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-01-09 04:44:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:53,966 INFO L225 Difference]: With dead ends: 129162 [2025-01-09 04:44:53,966 INFO L226 Difference]: Without dead ends: 118150 [2025-01-09 04:44:54,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:44:54,008 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1062 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:54,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1508 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:44:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118150 states. [2025-01-09 04:44:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118150 to 78876. [2025-01-09 04:44:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78876 states, 78875 states have (on average 1.3909350237717908) internal successors, (109710), 78875 states have internal predecessors, (109710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78876 states to 78876 states and 109710 transitions. [2025-01-09 04:44:55,615 INFO L78 Accepts]: Start accepts. Automaton has 78876 states and 109710 transitions. Word has length 83 [2025-01-09 04:44:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:55,615 INFO L471 AbstractCegarLoop]: Abstraction has 78876 states and 109710 transitions. [2025-01-09 04:44:55,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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-01-09 04:44:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 78876 states and 109710 transitions. [2025-01-09 04:44:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:44:55,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:55,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:44:55,629 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:55,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1912018706, now seen corresponding path program 1 times [2025-01-09 04:44:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222087178] [2025-01-09 04:44:55,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:44:55,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:44:55,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222087178] [2025-01-09 04:44:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222087178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:44:55,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:44:55,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:44:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999631290] [2025-01-09 04:44:55,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:44:55,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:44:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:55,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:44:55,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:44:55,712 INFO L87 Difference]: Start difference. First operand 78876 states and 109710 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:56,210 INFO L93 Difference]: Finished difference Result 178190 states and 249079 transitions. [2025-01-09 04:44:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:44:56,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 04:44:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:56,385 INFO L225 Difference]: With dead ends: 178190 [2025-01-09 04:44:56,386 INFO L226 Difference]: Without dead ends: 126123 [2025-01-09 04:44:56,446 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-01-09 04:44:56,447 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 123 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:56,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 498 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:44:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126123 states.