./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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 4243fe6692f4db96df8f6b90dae65e2f8a23804630be612d5daf50a5894e5fe2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:43:13,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:43:13,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:43:13,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:43:13,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:43:13,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:43:13,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:43:13,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:43:13,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:43:13,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:43:13,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:43:13,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:43:13,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:43:13,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:43:13,954 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:43:13,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:43:13,955 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:43:13,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:43:13,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:43:13,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:43:13,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:43:13,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:43:13,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:43:13,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:43:13,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:43:13,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:43:13,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:43:13,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 -> 4243fe6692f4db96df8f6b90dae65e2f8a23804630be612d5daf50a5894e5fe2 [2025-02-05 17:43:14,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:43:14,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:43:14,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:43:14,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:43:14,203 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:43:14,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-02-05 17:43:15,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bd09e9f2/be8ba699ba574fa1b600da282eecac06/FLAGf7a21bbc4 [2025-02-05 17:43:15,768 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:43:15,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-02-05 17:43:15,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bd09e9f2/be8ba699ba574fa1b600da282eecac06/FLAGf7a21bbc4 [2025-02-05 17:43:15,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bd09e9f2/be8ba699ba574fa1b600da282eecac06 [2025-02-05 17:43:15,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:43:15,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:43:15,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:43:15,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:43:15,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:43:15,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:43:15" (1/1) ... [2025-02-05 17:43:15,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4962ca68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:15, skipping insertion in model container [2025-02-05 17:43:15,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:43:15" (1/1) ... [2025-02-05 17:43:15,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:43:16,176 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[11742,11755] [2025-02-05 17:43:16,230 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[18803,18816] [2025-02-05 17:43:16,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:43:16,624 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:43:16,654 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[11742,11755] [2025-02-05 17:43:16,664 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[18803,18816] [2025-02-05 17:43:16,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:43:16,907 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:43:16,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16 WrapperNode [2025-02-05 17:43:16,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:43:16,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:43:16,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:43:16,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:43:16,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:16,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,192 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5089 [2025-02-05 17:43:17,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:43:17,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:43:17,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:43:17,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:43:17,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,344 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-02-05 17:43:17,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:43:17,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:43:17,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:43:17,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:43:17,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (1/1) ... [2025-02-05 17:43:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:43:17,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:17,613 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-02-05 17:43:17,619 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-02-05 17:43:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:43:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:43:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:43:17,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:43:17,708 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:43:17,709 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:43:20,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: havoc calculate_output_#t~ret37#1; [2025-02-05 17:43:20,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3607: havoc calculate_output2_#t~ret38#1; [2025-02-05 17:43:20,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5097: havoc calculate_output3_#t~ret39#1; [2025-02-05 17:43:21,031 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-02-05 17:43:21,032 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:43:21,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:43:21,060 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:43:21,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:43:21 BoogieIcfgContainer [2025-02-05 17:43:21,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:43:21,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:43:21,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:43:21,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:43:21,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:43:15" (1/3) ... [2025-02-05 17:43:21,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423907e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:43:21, skipping insertion in model container [2025-02-05 17:43:21,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:16" (2/3) ... [2025-02-05 17:43:21,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423907e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:43:21, skipping insertion in model container [2025-02-05 17:43:21,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:43:21" (3/3) ... [2025-02-05 17:43:21,068 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-02-05 17:43:21,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:43:21,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:43:21,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:43:21,157 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;@1418a1ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:43:21,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:43:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:43:21,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:21,167 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] [2025-02-05 17:43:21,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:21,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:21,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1170366575, now seen corresponding path program 1 times [2025-02-05 17:43:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255419034] [2025-02-05 17:43:21,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:21,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:43:21,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:43:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:21,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:21,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255419034] [2025-02-05 17:43:21,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255419034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:21,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:43:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112214545] [2025-02-05 17:43:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:21,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:43:21,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:21,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:43:21,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:43:21,382 INFO L87 Difference]: Start difference. First operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:21,443 INFO L93 Difference]: Finished difference Result 1758 states and 3337 transitions. [2025-02-05 17:43:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:43:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:43:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:21,459 INFO L225 Difference]: With dead ends: 1758 [2025-02-05 17:43:21,460 INFO L226 Difference]: Without dead ends: 833 [2025-02-05 17:43:21,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:43:21,467 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:21,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-05 17:43:21,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-05 17:43:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8941034897713598) internal successors, (1574), 832 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1574 transitions. [2025-02-05 17:43:21,536 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1574 transitions. Word has length 24 [2025-02-05 17:43:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:21,536 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1574 transitions. [2025-02-05 17:43:21,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1574 transitions. [2025-02-05 17:43:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:43:21,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:21,537 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] [2025-02-05 17:43:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:43:21,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:21,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-02-05 17:43:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564762676] [2025-02-05 17:43:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:21,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:43:21,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:43:21,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:21,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:21,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:21,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564762676] [2025-02-05 17:43:21,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564762676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:21,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:21,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:43:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798602378] [2025-02-05 17:43:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:21,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:43:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:21,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:43:21,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:43:21,762 INFO L87 Difference]: Start difference. First operand 833 states and 1574 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:21,855 INFO L93 Difference]: Finished difference Result 879 states and 1645 transitions. [2025-02-05 17:43:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:43:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:43:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:21,860 INFO L225 Difference]: With dead ends: 879 [2025-02-05 17:43:21,861 INFO L226 Difference]: Without dead ends: 833 [2025-02-05 17:43:21,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:43:21,862 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 0 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:21,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6252 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-05 17:43:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-05 17:43:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8567990373044525) internal successors, (1543), 832 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1543 transitions. [2025-02-05 17:43:21,882 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1543 transitions. Word has length 24 [2025-02-05 17:43:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:21,883 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1543 transitions. [2025-02-05 17:43:21,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1543 transitions. [2025-02-05 17:43:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:43:21,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:21,885 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] [2025-02-05 17:43:21,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:43:21,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-02-05 17:43:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874643320] [2025-02-05 17:43:21,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:21,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:43:21,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:43:21,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:21,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874643320] [2025-02-05 17:43:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874643320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:22,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:22,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387039044] [2025-02-05 17:43:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:22,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:22,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:22,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:22,077 INFO L87 Difference]: Start difference. First operand 833 states and 1543 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:22,277 INFO L93 Difference]: Finished difference Result 1253 states and 2213 transitions. [2025-02-05 17:43:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:43:22,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 17:43:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:22,286 INFO L225 Difference]: With dead ends: 1253 [2025-02-05 17:43:22,287 INFO L226 Difference]: Without dead ends: 1211 [2025-02-05 17:43:22,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 17:43:22,290 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7898 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7898 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:22,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7898 Valid, 2999 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-02-05 17:43:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 873. [2025-02-05 17:43:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8450057405281286) internal successors, (1607), 872 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1607 transitions. [2025-02-05 17:43:22,312 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1607 transitions. Word has length 54 [2025-02-05 17:43:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:22,312 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1607 transitions. [2025-02-05 17:43:22,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1607 transitions. [2025-02-05 17:43:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:43:22,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:22,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] [2025-02-05 17:43:22,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:43:22,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-02-05 17:43:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445796501] [2025-02-05 17:43:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:22,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:43:22,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:43:22,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:22,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445796501] [2025-02-05 17:43:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445796501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:22,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644211626] [2025-02-05 17:43:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:22,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:22,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:22,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:22,424 INFO L87 Difference]: Start difference. First operand 873 states and 1607 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:22,452 INFO L93 Difference]: Finished difference Result 1026 states and 1850 transitions. [2025-02-05 17:43:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-05 17:43:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:22,456 INFO L225 Difference]: With dead ends: 1026 [2025-02-05 17:43:22,456 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 17:43:22,457 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-02-05 17:43:22,459 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1603 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-02-05 17:43:22,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 17:43:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-02-05 17:43:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.824468085106383) internal successors, (1715), 941 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1715 transitions. [2025-02-05 17:43:22,479 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1715 transitions. Word has length 56 [2025-02-05 17:43:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:22,480 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1715 transitions. [2025-02-05 17:43:22,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1715 transitions. [2025-02-05 17:43:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:43:22,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:22,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:22,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:43:22,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:22,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-02-05 17:43:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:22,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093883712] [2025-02-05 17:43:22,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:22,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:22,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:43:22,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:43:22,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:22,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:22,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093883712] [2025-02-05 17:43:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093883712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807076639] [2025-02-05 17:43:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:22,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:22,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:22,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:22,713 INFO L87 Difference]: Start difference. First operand 942 states and 1715 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:22,852 INFO L93 Difference]: Finished difference Result 1095 states and 1955 transitions. [2025-02-05 17:43:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:22,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-05 17:43:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:22,855 INFO L225 Difference]: With dead ends: 1095 [2025-02-05 17:43:22,855 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 17:43:22,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:43:22,856 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 7449 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7449 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:22,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7449 Valid, 1789 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 17:43:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-02-05 17:43:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.8223404255319149) internal successors, (1713), 941 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1713 transitions. [2025-02-05 17:43:22,872 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1713 transitions. Word has length 56 [2025-02-05 17:43:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:22,873 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1713 transitions. [2025-02-05 17:43:22,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1713 transitions. [2025-02-05 17:43:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:43:22,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:22,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:22,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:43:22,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:22,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-02-05 17:43:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:22,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843136802] [2025-02-05 17:43:22,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:22,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:43:22,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:43:22,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:22,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843136802] [2025-02-05 17:43:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843136802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:43:23,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935458247] [2025-02-05 17:43:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:23,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:43:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:23,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:43:23,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:43:23,136 INFO L87 Difference]: Start difference. First operand 942 states and 1713 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:23,186 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2025-02-05 17:43:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:43:23,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 17:43:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:23,190 INFO L225 Difference]: With dead ends: 950 [2025-02-05 17:43:23,190 INFO L226 Difference]: Without dead ends: 948 [2025-02-05 17:43:23,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:43:23,191 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 0 mSDsluCounter, 9209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10746 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:23,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10746 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-02-05 17:43:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2025-02-05 17:43:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8160676532769555) internal successors, (1718), 947 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1718 transitions. [2025-02-05 17:43:23,207 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1718 transitions. Word has length 57 [2025-02-05 17:43:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:23,207 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1718 transitions. [2025-02-05 17:43:23,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1718 transitions. [2025-02-05 17:43:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:23,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:23,208 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] [2025-02-05 17:43:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:43:23,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-02-05 17:43:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793535305] [2025-02-05 17:43:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:23,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:23,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:23,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:23,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:23,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793535305] [2025-02-05 17:43:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793535305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:23,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:23,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:23,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464904772] [2025-02-05 17:43:23,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:23,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:23,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:23,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:23,249 INFO L87 Difference]: Start difference. First operand 948 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:23,268 INFO L93 Difference]: Finished difference Result 1118 states and 1979 transitions. [2025-02-05 17:43:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:23,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:23,272 INFO L225 Difference]: With dead ends: 1118 [2025-02-05 17:43:23,272 INFO L226 Difference]: Without dead ends: 1030 [2025-02-05 17:43:23,273 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-02-05 17:43:23,273 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:23,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:23,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-05 17:43:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1028. [2025-02-05 17:43:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1026 states have (on average 1.7923976608187135) internal successors, (1839), 1027 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1839 transitions. [2025-02-05 17:43:23,289 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1839 transitions. Word has length 58 [2025-02-05 17:43:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1839 transitions. [2025-02-05 17:43:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1839 transitions. [2025-02-05 17:43:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:23,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:23,290 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] [2025-02-05 17:43:23,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:43:23,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:23,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-02-05 17:43:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508106303] [2025-02-05 17:43:23,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:23,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:23,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:23,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:23,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:23,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508106303] [2025-02-05 17:43:23,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508106303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:23,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124183862] [2025-02-05 17:43:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:23,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:23,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:23,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:23,356 INFO L87 Difference]: Start difference. First operand 1028 states and 1839 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:23,376 INFO L93 Difference]: Finished difference Result 1474 states and 2519 transitions. [2025-02-05 17:43:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:23,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:23,380 INFO L225 Difference]: With dead ends: 1474 [2025-02-05 17:43:23,380 INFO L226 Difference]: Without dead ends: 1239 [2025-02-05 17:43:23,381 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-02-05 17:43:23,381 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1494 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:23,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-02-05 17:43:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1237. [2025-02-05 17:43:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1235 states have (on average 1.7417004048582996) internal successors, (2151), 1236 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2151 transitions. [2025-02-05 17:43:23,401 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2151 transitions. Word has length 58 [2025-02-05 17:43:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:23,402 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 2151 transitions. [2025-02-05 17:43:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2151 transitions. [2025-02-05 17:43:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:23,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:23,402 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] [2025-02-05 17:43:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:43:23,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-02-05 17:43:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926917268] [2025-02-05 17:43:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:23,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:23,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:23,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:23,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926917268] [2025-02-05 17:43:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926917268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:23,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452838200] [2025-02-05 17:43:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:23,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:23,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:23,441 INFO L87 Difference]: Start difference. First operand 1237 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:23,465 INFO L93 Difference]: Finished difference Result 2077 states and 3413 transitions. [2025-02-05 17:43:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:23,470 INFO L225 Difference]: With dead ends: 2077 [2025-02-05 17:43:23,470 INFO L226 Difference]: Without dead ends: 1633 [2025-02-05 17:43:23,471 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-02-05 17:43:23,471 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1492 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:23,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-02-05 17:43:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1631. [2025-02-05 17:43:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6740331491712708) internal successors, (2727), 1630 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2727 transitions. [2025-02-05 17:43:23,500 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2727 transitions. Word has length 58 [2025-02-05 17:43:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:23,500 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2727 transitions. [2025-02-05 17:43:23,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2727 transitions. [2025-02-05 17:43:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:23,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:23,501 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] [2025-02-05 17:43:23,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:43:23,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-02-05 17:43:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287972336] [2025-02-05 17:43:23,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:23,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:23,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:23,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:23,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287972336] [2025-02-05 17:43:23,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287972336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:23,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:23,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235994513] [2025-02-05 17:43:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:23,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:23,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:23,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:23,539 INFO L87 Difference]: Start difference. First operand 1631 states and 2727 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:23,567 INFO L93 Difference]: Finished difference Result 3211 states and 5057 transitions. [2025-02-05 17:43:23,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:23,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:23,575 INFO L225 Difference]: With dead ends: 3211 [2025-02-05 17:43:23,575 INFO L226 Difference]: Without dead ends: 2373 [2025-02-05 17:43:23,576 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-02-05 17:43:23,576 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1490 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:23,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1673 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-02-05 17:43:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2371. [2025-02-05 17:43:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2369 states have (on average 1.5968763191219923) internal successors, (3783), 2370 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3783 transitions. [2025-02-05 17:43:23,618 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3783 transitions. Word has length 58 [2025-02-05 17:43:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:23,618 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3783 transitions. [2025-02-05 17:43:23,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3783 transitions. [2025-02-05 17:43:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:23,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:23,619 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] [2025-02-05 17:43:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:43:23,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-02-05 17:43:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493173017] [2025-02-05 17:43:23,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:23,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:23,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:23,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:23,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:23,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493173017] [2025-02-05 17:43:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493173017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992686088] [2025-02-05 17:43:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:23,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:23,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:23,659 INFO L87 Difference]: Start difference. First operand 2371 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:23,700 INFO L93 Difference]: Finished difference Result 5335 states and 8057 transitions. [2025-02-05 17:43:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:23,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:23,711 INFO L225 Difference]: With dead ends: 5335 [2025-02-05 17:43:23,711 INFO L226 Difference]: Without dead ends: 3757 [2025-02-05 17:43:23,713 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-02-05 17:43:23,714 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1488 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:23,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2025-02-05 17:43:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3755. [2025-02-05 17:43:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3753 states have (on average 1.5195843325339728) internal successors, (5703), 3754 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 5703 transitions. [2025-02-05 17:43:23,782 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 5703 transitions. Word has length 58 [2025-02-05 17:43:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 5703 transitions. [2025-02-05 17:43:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 5703 transitions. [2025-02-05 17:43:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:43:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:23,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:43:23,783 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1445214600, now seen corresponding path program 1 times [2025-02-05 17:43:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512613959] [2025-02-05 17:43:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:23,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:43:23,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:43:23,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:23,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512613959] [2025-02-05 17:43:23,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512613959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:23,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:23,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:43:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570873208] [2025-02-05 17:43:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:23,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:23,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:23,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:23,822 INFO L87 Difference]: Start difference. First operand 3755 states and 5703 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:26,371 INFO L93 Difference]: Finished difference Result 5259 states and 8576 transitions. [2025-02-05 17:43:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:26,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-05 17:43:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:26,385 INFO L225 Difference]: With dead ends: 5259 [2025-02-05 17:43:26,385 INFO L226 Difference]: Without dead ends: 4506 [2025-02-05 17:43:26,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:26,388 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 844 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:26,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 579 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 17:43:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2025-02-05 17:43:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 4506. [2025-02-05 17:43:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 4504 states have (on average 1.483570159857904) internal successors, (6682), 4505 states have internal predecessors, (6682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 6682 transitions. [2025-02-05 17:43:26,472 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 6682 transitions. Word has length 61 [2025-02-05 17:43:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:26,472 INFO L471 AbstractCegarLoop]: Abstraction has 4506 states and 6682 transitions. [2025-02-05 17:43:26,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 6682 transitions. [2025-02-05 17:43:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:26,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:26,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:26,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:43:26,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:26,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-02-05 17:43:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148729363] [2025-02-05 17:43:26,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:26,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:26,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:26,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:26,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:43:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148729363] [2025-02-05 17:43:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148729363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:26,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:26,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:26,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855727654] [2025-02-05 17:43:26,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:26,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:26,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:26,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:26,610 INFO L87 Difference]: Start difference. First operand 4506 states and 6682 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:26,832 INFO L93 Difference]: Finished difference Result 19110 states and 27488 transitions. [2025-02-05 17:43:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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-02-05 17:43:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:26,866 INFO L225 Difference]: With dead ends: 19110 [2025-02-05 17:43:26,866 INFO L226 Difference]: Without dead ends: 16996 [2025-02-05 17:43:26,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:26,875 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6305 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6305 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:26,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6305 Valid, 3716 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16996 states. [2025-02-05 17:43:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16996 to 7050. [2025-02-05 17:43:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7048 states have (on average 1.456583427922815) internal successors, (10266), 7049 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 10266 transitions. [2025-02-05 17:43:27,118 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 10266 transitions. Word has length 77 [2025-02-05 17:43:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:27,118 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 10266 transitions. [2025-02-05 17:43:27,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 10266 transitions. [2025-02-05 17:43:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:27,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:27,121 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:43:27,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:27,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-02-05 17:43:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:27,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752443588] [2025-02-05 17:43:27,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:27,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:27,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:27,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:27,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:43:27,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:27,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752443588] [2025-02-05 17:43:27,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752443588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042830482] [2025-02-05 17:43:27,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:27,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:27,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:27,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:27,251 INFO L87 Difference]: Start difference. First operand 7050 states and 10266 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:27,513 INFO L93 Difference]: Finished difference Result 22070 states and 31680 transitions. [2025-02-05 17:43:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-02-05 17:43:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:27,545 INFO L225 Difference]: With dead ends: 22070 [2025-02-05 17:43:27,545 INFO L226 Difference]: Without dead ends: 19108 [2025-02-05 17:43:27,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:27,555 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6307 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6307 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:27,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6307 Valid, 3685 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2025-02-05 17:43:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 11066. [2025-02-05 17:43:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 11064 states have (on average 1.4383586406362978) internal successors, (15914), 11065 states have internal predecessors, (15914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 15914 transitions. [2025-02-05 17:43:27,815 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 15914 transitions. Word has length 77 [2025-02-05 17:43:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:27,815 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 15914 transitions. [2025-02-05 17:43:27,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 15914 transitions. [2025-02-05 17:43:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:27,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:27,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:27,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:43:27,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:27,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-02-05 17:43:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:27,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008926287] [2025-02-05 17:43:27,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:27,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:27,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:43:27,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:27,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008926287] [2025-02-05 17:43:27,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008926287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:27,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:27,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:27,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058662011] [2025-02-05 17:43:27,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:27,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:27,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:27,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:27,923 INFO L87 Difference]: Start difference. First operand 11066 states and 15914 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:28,200 INFO L93 Difference]: Finished difference Result 25030 states and 35856 transitions. [2025-02-05 17:43:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-05 17:43:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:28,232 INFO L225 Difference]: With dead ends: 25030 [2025-02-05 17:43:28,232 INFO L226 Difference]: Without dead ends: 22068 [2025-02-05 17:43:28,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:28,241 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6329 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6329 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:28,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6329 Valid, 3651 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22068 states. [2025-02-05 17:43:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22068 to 14026. [2025-02-05 17:43:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14026 states, 14024 states have (on average 1.4325442099258414) internal successors, (20090), 14025 states have internal predecessors, (20090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14026 states to 14026 states and 20090 transitions. [2025-02-05 17:43:28,549 INFO L78 Accepts]: Start accepts. Automaton has 14026 states and 20090 transitions. Word has length 77 [2025-02-05 17:43:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:28,549 INFO L471 AbstractCegarLoop]: Abstraction has 14026 states and 20090 transitions. [2025-02-05 17:43:28,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 14026 states and 20090 transitions. [2025-02-05 17:43:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:28,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:28,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:28,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:43:28,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:28,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-02-05 17:43:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615387488] [2025-02-05 17:43:28,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:28,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:28,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:28,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:28,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:43:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615387488] [2025-02-05 17:43:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615387488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87899969] [2025-02-05 17:43:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:28,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:28,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:28,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:28,666 INFO L87 Difference]: Start difference. First operand 14026 states and 20090 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-02-05 17:43:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:28,995 INFO L93 Difference]: Finished difference Result 27990 states and 40032 transitions. [2025-02-05 17:43:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:28,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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 77 [2025-02-05 17:43:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:29,027 INFO L225 Difference]: With dead ends: 27990 [2025-02-05 17:43:29,027 INFO L226 Difference]: Without dead ends: 25028 [2025-02-05 17:43:29,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:29,039 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6367 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6367 SdHoareTripleChecker+Valid, 3642 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:29,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6367 Valid, 3642 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2025-02-05 17:43:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 16986. [2025-02-05 17:43:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16986 states, 16984 states have (on average 1.4287564766839378) internal successors, (24266), 16985 states have internal predecessors, (24266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16986 states to 16986 states and 24266 transitions. [2025-02-05 17:43:29,381 INFO L78 Accepts]: Start accepts. Automaton has 16986 states and 24266 transitions. Word has length 77 [2025-02-05 17:43:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:29,381 INFO L471 AbstractCegarLoop]: Abstraction has 16986 states and 24266 transitions. [2025-02-05 17:43:29,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-02-05 17:43:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16986 states and 24266 transitions. [2025-02-05 17:43:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:29,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:29,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:29,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:43:29,384 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:29,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-02-05 17:43:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:29,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157407138] [2025-02-05 17:43:29,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:29,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:29,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:29,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:29,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:43:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157407138] [2025-02-05 17:43:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157407138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758119930] [2025-02-05 17:43:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:29,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:29,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:29,474 INFO L87 Difference]: Start difference. First operand 16986 states and 24266 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-02-05 17:43:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:29,985 INFO L93 Difference]: Finished difference Result 30950 states and 44208 transitions. [2025-02-05 17:43:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:29,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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 77 [2025-02-05 17:43:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:30,023 INFO L225 Difference]: With dead ends: 30950 [2025-02-05 17:43:30,023 INFO L226 Difference]: Without dead ends: 27988 [2025-02-05 17:43:30,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:30,033 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6327 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6327 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:30,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6327 Valid, 3675 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27988 states. [2025-02-05 17:43:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27988 to 19946. [2025-02-05 17:43:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.426093060569595) internal successors, (28442), 19945 states have internal predecessors, (28442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28442 transitions. [2025-02-05 17:43:30,578 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28442 transitions. Word has length 77 [2025-02-05 17:43:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:30,578 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28442 transitions. [2025-02-05 17:43:30,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-02-05 17:43:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28442 transitions. [2025-02-05 17:43:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 17:43:30,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:30,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:43:30,581 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-02-05 17:43:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038131747] [2025-02-05 17:43:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:30,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 17:43:30,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 17:43:30,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038131747] [2025-02-05 17:43:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038131747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:30,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:30,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950844653] [2025-02-05 17:43:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:30,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:30,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:30,670 INFO L87 Difference]: Start difference. First operand 19946 states and 28442 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-02-05 17:43:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:30,932 INFO L93 Difference]: Finished difference Result 38350 states and 54428 transitions. [2025-02-05 17:43:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:30,932 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-02-05 17:43:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:30,957 INFO L225 Difference]: With dead ends: 38350 [2025-02-05 17:43:30,958 INFO L226 Difference]: Without dead ends: 19948 [2025-02-05 17:43:30,975 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-02-05 17:43:30,975 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 45 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:30,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-02-05 17:43:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 19946. [2025-02-05 17:43:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19946 states, 19944 states have (on average 1.411251504211793) internal successors, (28146), 19945 states have internal predecessors, (28146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 28146 transitions. [2025-02-05 17:43:31,357 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 28146 transitions. Word has length 78 [2025-02-05 17:43:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:31,357 INFO L471 AbstractCegarLoop]: Abstraction has 19946 states and 28146 transitions. [2025-02-05 17:43:31,357 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-02-05 17:43:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 28146 transitions. [2025-02-05 17:43:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:43:31,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:31,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:43:31,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:31,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-02-05 17:43:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:31,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762912409] [2025-02-05 17:43:31,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:31,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:43:31,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:43:31,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:31,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762912409] [2025-02-05 17:43:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762912409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199802740] [2025-02-05 17:43:31,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:31,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:31,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:31,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:31,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:31,413 INFO L87 Difference]: Start difference. First operand 19946 states and 28146 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:31,519 INFO L93 Difference]: Finished difference Result 26833 states and 37840 transitions. [2025-02-05 17:43:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:31,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 17:43:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:31,532 INFO L225 Difference]: With dead ends: 26833 [2025-02-05 17:43:31,532 INFO L226 Difference]: Without dead ends: 8431 [2025-02-05 17:43:31,546 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-02-05 17:43:31,546 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 39 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:31,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2025-02-05 17:43:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8423. [2025-02-05 17:43:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 8421 states have (on average 1.4296401852511578) internal successors, (12039), 8422 states have internal predecessors, (12039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12039 transitions. [2025-02-05 17:43:31,674 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12039 transitions. Word has length 79 [2025-02-05 17:43:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:31,674 INFO L471 AbstractCegarLoop]: Abstraction has 8423 states and 12039 transitions. [2025-02-05 17:43:31,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12039 transitions. [2025-02-05 17:43:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:43:31,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:31,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:43:31,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-02-05 17:43:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670130678] [2025-02-05 17:43:31,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:31,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:43:31,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:43:31,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:31,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:31,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:31,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670130678] [2025-02-05 17:43:31,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670130678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:31,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:31,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:31,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790558739] [2025-02-05 17:43:31,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:31,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:31,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:31,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:31,739 INFO L87 Difference]: Start difference. First operand 8423 states and 12039 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:31,794 INFO L93 Difference]: Finished difference Result 11859 states and 16825 transitions. [2025-02-05 17:43:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:31,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 17:43:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:31,803 INFO L225 Difference]: With dead ends: 11859 [2025-02-05 17:43:31,803 INFO L226 Difference]: Without dead ends: 4993 [2025-02-05 17:43:31,808 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-02-05 17:43:31,811 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 41 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:31,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-02-05 17:43:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2025-02-05 17:43:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4989 states have (on average 1.44377630787733) internal successors, (7203), 4990 states have internal predecessors, (7203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 7203 transitions. [2025-02-05 17:43:31,880 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 7203 transitions. Word has length 80 [2025-02-05 17:43:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 7203 transitions. [2025-02-05 17:43:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 7203 transitions. [2025-02-05 17:43:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 17:43:31,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:31,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:43:31,882 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-02-05 17:43:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164287827] [2025-02-05 17:43:31,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:31,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 17:43:31,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 17:43:31,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:31,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164287827] [2025-02-05 17:43:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164287827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:31,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:31,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:31,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421997119] [2025-02-05 17:43:31,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:31,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:31,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:31,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:31,945 INFO L87 Difference]: Start difference. First operand 4991 states and 7203 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-02-05 17:43:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:31,980 INFO L93 Difference]: Finished difference Result 6711 states and 9571 transitions. [2025-02-05 17:43:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:31,981 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-02-05 17:43:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:31,987 INFO L225 Difference]: With dead ends: 6711 [2025-02-05 17:43:31,987 INFO L226 Difference]: Without dead ends: 3277 [2025-02-05 17:43:31,991 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-02-05 17:43:31,992 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 38 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:31,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-02-05 17:43:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3275. [2025-02-05 17:43:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3273 states have (on average 1.4699052856706385) internal successors, (4811), 3274 states have internal predecessors, (4811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4811 transitions. [2025-02-05 17:43:32,049 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4811 transitions. Word has length 82 [2025-02-05 17:43:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:32,050 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 4811 transitions. [2025-02-05 17:43:32,051 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-02-05 17:43:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4811 transitions. [2025-02-05 17:43:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:43:32,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:32,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:32,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:43:32,052 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-02-05 17:43:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830383906] [2025-02-05 17:43:32,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:32,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:32,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:43:32,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:43:32,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:32,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:32,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830383906] [2025-02-05 17:43:32,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830383906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:32,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330364809] [2025-02-05 17:43:32,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:32,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:32,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:32,113 INFO L87 Difference]: Start difference. First operand 3275 states and 4811 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:32,140 INFO L93 Difference]: Finished difference Result 4137 states and 5983 transitions. [2025-02-05 17:43:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:32,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 17:43:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:32,146 INFO L225 Difference]: With dead ends: 4137 [2025-02-05 17:43:32,146 INFO L226 Difference]: Without dead ends: 2419 [2025-02-05 17:43:32,148 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-02-05 17:43:32,151 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 35 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:32,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3054 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2025-02-05 17:43:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2417. [2025-02-05 17:43:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2415 states have (on average 1.5022774327122153) internal successors, (3628), 2416 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3628 transitions. [2025-02-05 17:43:32,182 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3628 transitions. Word has length 84 [2025-02-05 17:43:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 3628 transitions. [2025-02-05 17:43:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3628 transitions. [2025-02-05 17:43:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 17:43:32,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:32,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:32,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:43:32,183 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:32,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-02-05 17:43:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482394734] [2025-02-05 17:43:32,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:32,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:43:32,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:43:32,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:32,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:33,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482394734] [2025-02-05 17:43:33,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482394734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:33,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614412087] [2025-02-05 17:43:33,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:33,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:33,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:33,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:33,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:43:33,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:43:33,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:43:33,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:33,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:33,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:43:33,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:33,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614412087] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:34,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:34,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-02-05 17:43:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890379458] [2025-02-05 17:43:34,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:34,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 17:43:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:34,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 17:43:34,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-02-05 17:43:34,243 INFO L87 Difference]: Start difference. First operand 2417 states and 3628 transitions. Second operand has 28 states, 28 states have (on average 8.0) internal successors, (224), 27 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:36,445 INFO L93 Difference]: Finished difference Result 6747 states and 9511 transitions. [2025-02-05 17:43:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-05 17:43:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.0) internal successors, (224), 27 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-05 17:43:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:36,452 INFO L225 Difference]: With dead ends: 6747 [2025-02-05 17:43:36,452 INFO L226 Difference]: Without dead ends: 5887 [2025-02-05 17:43:36,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=986, Invalid=4270, Unknown=0, NotChecked=0, Total=5256 [2025-02-05 17:43:36,455 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 25425 mSDsluCounter, 6654 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25425 SdHoareTripleChecker+Valid, 8162 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:36,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25425 Valid, 8162 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:43:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5887 states. [2025-02-05 17:43:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5887 to 5771. [2025-02-05 17:43:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5771 states, 5769 states have (on average 1.3995493153059455) internal successors, (8074), 5770 states have internal predecessors, (8074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5771 states to 5771 states and 8074 transitions. [2025-02-05 17:43:36,536 INFO L78 Accepts]: Start accepts. Automaton has 5771 states and 8074 transitions. Word has length 86 [2025-02-05 17:43:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:36,537 INFO L471 AbstractCegarLoop]: Abstraction has 5771 states and 8074 transitions. [2025-02-05 17:43:36,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.0) internal successors, (224), 27 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 8074 transitions. [2025-02-05 17:43:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 17:43:36,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:36,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:36,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:43:36,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 17:43:36,739 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:36,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-02-05 17:43:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000254264] [2025-02-05 17:43:36,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:43:36,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:43:36,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:36,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000254264] [2025-02-05 17:43:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000254264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327051351] [2025-02-05 17:43:36,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:36,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:36,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:43:37,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:43:37,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:43:37,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:37,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:37,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:43:37,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:37,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327051351] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:38,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 31 [2025-02-05 17:43:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912218106] [2025-02-05 17:43:38,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 17:43:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:38,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 17:43:38,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:43:38,182 INFO L87 Difference]: Start difference. First operand 5771 states and 8074 transitions. Second operand has 32 states, 32 states have (on average 7.34375) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:39,690 INFO L93 Difference]: Finished difference Result 19201 states and 25982 transitions. [2025-02-05 17:43:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 17:43:39,690 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.34375) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-05 17:43:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:39,703 INFO L225 Difference]: With dead ends: 19201 [2025-02-05 17:43:39,704 INFO L226 Difference]: Without dead ends: 14987 [2025-02-05 17:43:39,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=877, Invalid=3155, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 17:43:39,710 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 19139 mSDsluCounter, 6959 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19139 SdHoareTripleChecker+Valid, 8495 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:39,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19139 Valid, 8495 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:43:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14987 states. [2025-02-05 17:43:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14987 to 14897. [2025-02-05 17:43:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14897 states, 14895 states have (on average 1.331050688150386) internal successors, (19826), 14896 states have internal predecessors, (19826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14897 states to 14897 states and 19826 transitions. [2025-02-05 17:43:40,005 INFO L78 Accepts]: Start accepts. Automaton has 14897 states and 19826 transitions. Word has length 87 [2025-02-05 17:43:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:40,005 INFO L471 AbstractCegarLoop]: Abstraction has 14897 states and 19826 transitions. [2025-02-05 17:43:40,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.34375) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 14897 states and 19826 transitions. [2025-02-05 17:43:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:43:40,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:40,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:40,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:43:40,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:40,208 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:40,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1347305649, now seen corresponding path program 1 times [2025-02-05 17:43:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:40,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074348155] [2025-02-05 17:43:40,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:40,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:40,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:40,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:40,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:40,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074348155] [2025-02-05 17:43:40,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074348155] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066139435] [2025-02-05 17:43:40,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:40,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:40,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:40,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:40,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:43:40,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:40,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:40,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:40,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:43:40,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:41,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:41,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066139435] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:41,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 17:43:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177175304] [2025-02-05 17:43:41,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 17:43:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 17:43:41,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:43:41,791 INFO L87 Difference]: Start difference. First operand 14897 states and 19826 transitions. Second operand has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:42,343 INFO L93 Difference]: Finished difference Result 28709 states and 37886 transitions. [2025-02-05 17:43:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:43:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 17:43:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:42,357 INFO L225 Difference]: With dead ends: 28709 [2025-02-05 17:43:42,357 INFO L226 Difference]: Without dead ends: 15369 [2025-02-05 17:43:42,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 17:43:42,366 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 15398 mSDsluCounter, 4780 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15398 SdHoareTripleChecker+Valid, 6297 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:42,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15398 Valid, 6297 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:43:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2025-02-05 17:43:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 12947. [2025-02-05 17:43:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12947 states, 12945 states have (on average 1.327694090382387) internal successors, (17187), 12946 states have internal predecessors, (17187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12947 states to 12947 states and 17187 transitions. [2025-02-05 17:43:42,636 INFO L78 Accepts]: Start accepts. Automaton has 12947 states and 17187 transitions. Word has length 89 [2025-02-05 17:43:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:42,636 INFO L471 AbstractCegarLoop]: Abstraction has 12947 states and 17187 transitions. [2025-02-05 17:43:42,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 12947 states and 17187 transitions. [2025-02-05 17:43:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:43:42,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:42,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:42,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:43:42,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:42,838 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:42,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1256237073, now seen corresponding path program 1 times [2025-02-05 17:43:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:42,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474140713] [2025-02-05 17:43:42,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:42,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:42,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:42,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:42,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:43,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474140713] [2025-02-05 17:43:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474140713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:43,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213581676] [2025-02-05 17:43:43,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:43,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:43,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:43,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:43:43,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:43,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:43,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:43,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:43,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:43:43,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:43,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:44,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213581676] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:44,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:44,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 17:43:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239490104] [2025-02-05 17:43:44,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:44,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 17:43:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:44,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 17:43:44,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-02-05 17:43:44,030 INFO L87 Difference]: Start difference. First operand 12947 states and 17187 transitions. Second operand has 22 states, 22 states have (on average 8.5) internal successors, (187), 21 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:44,732 INFO L93 Difference]: Finished difference Result 35729 states and 46622 transitions. [2025-02-05 17:43:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:43:44,732 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 21 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 17:43:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:44,751 INFO L225 Difference]: With dead ends: 35729 [2025-02-05 17:43:44,751 INFO L226 Difference]: Without dead ends: 24339 [2025-02-05 17:43:44,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2025-02-05 17:43:44,757 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 13708 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13708 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:44,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13708 Valid, 4863 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:43:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24339 states. [2025-02-05 17:43:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24339 to 24335. [2025-02-05 17:43:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24335 states, 24333 states have (on average 1.30468910533021) internal successors, (31747), 24334 states have internal predecessors, (31747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24335 states to 24335 states and 31747 transitions. [2025-02-05 17:43:45,410 INFO L78 Accepts]: Start accepts. Automaton has 24335 states and 31747 transitions. Word has length 89 [2025-02-05 17:43:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:45,410 INFO L471 AbstractCegarLoop]: Abstraction has 24335 states and 31747 transitions. [2025-02-05 17:43:45,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 21 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24335 states and 31747 transitions. [2025-02-05 17:43:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:43:45,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:45,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:45,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 17:43:45,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 17:43:45,613 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:45,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1917138110, now seen corresponding path program 1 times [2025-02-05 17:43:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:45,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038757545] [2025-02-05 17:43:45,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:45,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:43:45,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:43:45,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:45,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038757545] [2025-02-05 17:43:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038757545] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817172007] [2025-02-05 17:43:46,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:46,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:46,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:46,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:43:46,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:43:46,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:43:46,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:46,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:46,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:43:46,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:46,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817172007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:47,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-02-05 17:43:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005528977] [2025-02-05 17:43:47,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:47,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 17:43:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:47,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 17:43:47,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 17:43:47,706 INFO L87 Difference]: Start difference. First operand 24335 states and 31747 transitions. Second operand has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:53,406 INFO L93 Difference]: Finished difference Result 69315 states and 88840 transitions. [2025-02-05 17:43:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-05 17:43:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:43:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:53,460 INFO L225 Difference]: With dead ends: 69315 [2025-02-05 17:43:53,460 INFO L226 Difference]: Without dead ends: 58801 [2025-02-05 17:43:53,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1793, Invalid=7713, Unknown=0, NotChecked=0, Total=9506 [2025-02-05 17:43:53,475 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 17099 mSDsluCounter, 20640 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17099 SdHoareTripleChecker+Valid, 22177 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:53,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17099 Valid, 22177 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:43:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58801 states. [2025-02-05 17:43:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58801 to 35951. [2025-02-05 17:43:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35951 states, 35949 states have (on average 1.286350107096164) internal successors, (46243), 35950 states have internal predecessors, (46243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35951 states to 35951 states and 46243 transitions. [2025-02-05 17:43:54,478 INFO L78 Accepts]: Start accepts. Automaton has 35951 states and 46243 transitions. Word has length 90 [2025-02-05 17:43:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:54,478 INFO L471 AbstractCegarLoop]: Abstraction has 35951 states and 46243 transitions. [2025-02-05 17:43:54,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35951 states and 46243 transitions. [2025-02-05 17:43:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:43:54,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:54,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:54,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:43:54,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 17:43:54,681 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:54,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1370659710, now seen corresponding path program 1 times [2025-02-05 17:43:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193808568] [2025-02-05 17:43:54,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:43:54,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:43:54,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:54,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193808568] [2025-02-05 17:43:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193808568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981275136] [2025-02-05 17:43:55,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:55,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:55,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:55,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:55,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:43:55,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:43:55,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:43:55,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:55,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:55,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 17:43:55,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:55,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:56,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981275136] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:56,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:56,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-02-05 17:43:56,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513660732] [2025-02-05 17:43:56,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:56,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 17:43:56,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:56,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 17:43:56,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 17:43:56,597 INFO L87 Difference]: Start difference. First operand 35951 states and 46243 transitions. Second operand has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:02,514 INFO L93 Difference]: Finished difference Result 98965 states and 126724 transitions. [2025-02-05 17:44:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-02-05 17:44:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:44:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:02,586 INFO L225 Difference]: With dead ends: 98965 [2025-02-05 17:44:02,587 INFO L226 Difference]: Without dead ends: 80387 [2025-02-05 17:44:02,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1721, Invalid=7021, Unknown=0, NotChecked=0, Total=8742 [2025-02-05 17:44:02,608 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 14306 mSDsluCounter, 20855 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14306 SdHoareTripleChecker+Valid, 22422 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:02,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14306 Valid, 22422 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:44:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80387 states. [2025-02-05 17:44:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80387 to 30231. [2025-02-05 17:44:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30231 states, 30229 states have (on average 1.2843626980713885) internal successors, (38825), 30230 states have internal predecessors, (38825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30231 states to 30231 states and 38825 transitions. [2025-02-05 17:44:03,647 INFO L78 Accepts]: Start accepts. Automaton has 30231 states and 38825 transitions. Word has length 90 [2025-02-05 17:44:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:03,647 INFO L471 AbstractCegarLoop]: Abstraction has 30231 states and 38825 transitions. [2025-02-05 17:44:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30231 states and 38825 transitions. [2025-02-05 17:44:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:44:03,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:03,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:03,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 17:44:03,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 17:44:03,850 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1148870158, now seen corresponding path program 1 times [2025-02-05 17:44:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:03,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740451585] [2025-02-05 17:44:03,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:03,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:44:03,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:44:03,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:03,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740451585] [2025-02-05 17:44:05,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740451585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:05,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359199245] [2025-02-05 17:44:05,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:05,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:05,406 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:05,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 17:44:05,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:44:05,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:44:05,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:05,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:05,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:44:05,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:44:05,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:44:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:44:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359199245] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:44:05,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:44:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 6, 4] total 35 [2025-02-05 17:44:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899203887] [2025-02-05 17:44:05,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:44:05,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 17:44:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:05,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 17:44:05,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 17:44:05,838 INFO L87 Difference]: Start difference. First operand 30231 states and 38825 transitions. Second operand has 35 states, 35 states have (on average 7.314285714285714) internal successors, (256), 35 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:37,461 INFO L93 Difference]: Finished difference Result 122810 states and 153133 transitions. [2025-02-05 17:44:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 313 states. [2025-02-05 17:44:37,461 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.314285714285714) internal successors, (256), 35 states have internal predecessors, (256), 0 states have call successors, (0), 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-02-05 17:44:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:37,543 INFO L225 Difference]: With dead ends: 122810 [2025-02-05 17:44:37,543 INFO L226 Difference]: Without dead ends: 94136 [2025-02-05 17:44:37,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54728 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=19226, Invalid=98766, Unknown=0, NotChecked=0, Total=117992 [2025-02-05 17:44:37,568 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 26929 mSDsluCounter, 21636 mSDsCounter, 0 mSdLazyCounter, 6376 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26929 SdHoareTripleChecker+Valid, 23252 SdHoareTripleChecker+Invalid, 6612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 6376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:37,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26929 Valid, 23252 Invalid, 6612 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [236 Valid, 6376 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-05 17:44:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94136 states. [2025-02-05 17:44:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94136 to 69999. [2025-02-05 17:44:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69999 states, 69997 states have (on average 1.2254668057202451) internal successors, (85779), 69998 states have internal predecessors, (85779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69999 states to 69999 states and 85779 transitions. [2025-02-05 17:44:40,117 INFO L78 Accepts]: Start accepts. Automaton has 69999 states and 85779 transitions. Word has length 91 [2025-02-05 17:44:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:40,118 INFO L471 AbstractCegarLoop]: Abstraction has 69999 states and 85779 transitions. [2025-02-05 17:44:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.314285714285714) internal successors, (256), 35 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 69999 states and 85779 transitions. [2025-02-05 17:44:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:44:40,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:40,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:40,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0