./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3fb71e8e4e407700549b8952f3afdeeffa0973a11e08bb7f18bca04e4b75e49d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:29:01,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:29:01,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:29:01,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:29:01,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:29:01,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:29:01,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:29:01,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:29:01,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:29:01,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:29:01,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:29:01,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:29:01,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:29:01,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:29:01,537 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:29:01,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:29:01,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:29:01,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:01,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:29:01,539 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3fb71e8e4e407700549b8952f3afdeeffa0973a11e08bb7f18bca04e4b75e49d [2025-03-08 06:29:01,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:29:01,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:29:01,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:29:01,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:29:01,761 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:29:01,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:29:02,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d6c2372/414998b6148a460b9243c49bdc3c07e2/FLAG127ee49d2 [2025-03-08 06:29:03,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:29:03,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:29:03,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d6c2372/414998b6148a460b9243c49bdc3c07e2/FLAG127ee49d2 [2025-03-08 06:29:03,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87d6c2372/414998b6148a460b9243c49bdc3c07e2 [2025-03-08 06:29:03,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:29:03,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:29:03,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:03,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:29:03,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:29:03,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eee25a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03, skipping insertion in model container [2025-03-08 06:29:03,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:29:03,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10378,10391] [2025-03-08 06:29:03,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:03,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:29:03,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10378,10391] [2025-03-08 06:29:03,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:03,874 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:29:03,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03 WrapperNode [2025-03-08 06:29:03,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:03,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:03,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:29:03,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:29:03,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,936 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 904 [2025-03-08 06:29:03,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:03,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:29:03,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:29:03,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:29:03,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:29:03,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:29:03,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:29:03,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:29:03,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:29:03,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (1/1) ... [2025-03-08 06:29:03,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:03,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:29:04,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:29:04,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:29:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:29:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:29:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:29:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:29:04,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:29:04,138 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node3__m3~2#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L814: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node2__m2~2#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L507: havoc main_~node7__m7~1#1;havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node5__m5~2#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L910: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-03-08 06:29:04,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node4__m4~2#1; [2025-03-08 06:29:04,756 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-08 06:29:04,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:29:04,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:29:04,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:29:04,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:04 BoogieIcfgContainer [2025-03-08 06:29:04,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:29:04,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:29:04,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:29:04,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:29:04,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:29:03" (1/3) ... [2025-03-08 06:29:04,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4369449d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:04, skipping insertion in model container [2025-03-08 06:29:04,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:03" (2/3) ... [2025-03-08 06:29:04,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4369449d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:04, skipping insertion in model container [2025-03-08 06:29:04,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:04" (3/3) ... [2025-03-08 06:29:04,777 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:29:04,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:29:04,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 201 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:29:04,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:29:04,840 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;@315a8137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:29:04,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:29:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.763819095477387) internal successors, (351), 200 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:29:04,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:04,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:04,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1129340721, now seen corresponding path program 1 times [2025-03-08 06:29:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:04,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56441091] [2025-03-08 06:29:04,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:04,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:29:05,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:29:05,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:05,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:05,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56441091] [2025-03-08 06:29:05,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56441091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:05,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:05,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769871879] [2025-03-08 06:29:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:05,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:05,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:05,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:05,515 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.763819095477387) internal successors, (351), 200 states have internal predecessors, (351), 0 states have call successors, (0), 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 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:06,145 INFO L93 Difference]: Finished difference Result 1440 states and 2328 transitions. [2025-03-08 06:29:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:06,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:29:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:06,162 INFO L225 Difference]: With dead ends: 1440 [2025-03-08 06:29:06,162 INFO L226 Difference]: Without dead ends: 1332 [2025-03-08 06:29:06,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:06,168 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 2429 mSDsluCounter, 6748 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 7818 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:06,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2429 Valid, 7818 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-03-08 06:29:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 303. [2025-03-08 06:29:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4503311258278146) internal successors, (438), 302 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 438 transitions. [2025-03-08 06:29:06,231 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 438 transitions. Word has length 107 [2025-03-08 06:29:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 438 transitions. [2025-03-08 06:29:06,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 438 transitions. [2025-03-08 06:29:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:06,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:06,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:06,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:29:06,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1117734741, now seen corresponding path program 1 times [2025-03-08 06:29:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072676148] [2025-03-08 06:29:06,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:06,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:06,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:06,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:06,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072676148] [2025-03-08 06:29:06,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072676148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:06,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:06,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538931857] [2025-03-08 06:29:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:06,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:06,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:06,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:06,530 INFO L87 Difference]: Start difference. First operand 303 states and 438 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:06,851 INFO L93 Difference]: Finished difference Result 1559 states and 2435 transitions. [2025-03-08 06:29:06,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:06,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:06,858 INFO L225 Difference]: With dead ends: 1559 [2025-03-08 06:29:06,858 INFO L226 Difference]: Without dead ends: 1399 [2025-03-08 06:29:06,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:06,860 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 1716 mSDsluCounter, 3780 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:06,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 4820 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-08 06:29:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 482. [2025-03-08 06:29:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.5051975051975053) internal successors, (724), 481 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 724 transitions. [2025-03-08 06:29:06,891 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 724 transitions. Word has length 109 [2025-03-08 06:29:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:06,892 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 724 transitions. [2025-03-08 06:29:06,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 724 transitions. [2025-03-08 06:29:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:06,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:06,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:06,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:29:06,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:06,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:06,894 INFO L85 PathProgramCache]: Analyzing trace with hash 138871629, now seen corresponding path program 1 times [2025-03-08 06:29:06,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:06,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940882527] [2025-03-08 06:29:06,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:06,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:06,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:06,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:06,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:06,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:07,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940882527] [2025-03-08 06:29:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940882527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:07,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:07,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167820127] [2025-03-08 06:29:07,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:07,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:07,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:07,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:07,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:07,157 INFO L87 Difference]: Start difference. First operand 482 states and 724 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:07,478 INFO L93 Difference]: Finished difference Result 1738 states and 2721 transitions. [2025-03-08 06:29:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:07,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:07,484 INFO L225 Difference]: With dead ends: 1738 [2025-03-08 06:29:07,485 INFO L226 Difference]: Without dead ends: 1578 [2025-03-08 06:29:07,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:07,488 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 1709 mSDsluCounter, 3237 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 4167 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:07,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 4167 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-08 06:29:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 740. [2025-03-08 06:29:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.537212449255751) internal successors, (1136), 739 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1136 transitions. [2025-03-08 06:29:07,518 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1136 transitions. Word has length 109 [2025-03-08 06:29:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:07,519 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1136 transitions. [2025-03-08 06:29:07,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1136 transitions. [2025-03-08 06:29:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:07,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:07,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:07,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:29:07,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:07,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash -708736427, now seen corresponding path program 1 times [2025-03-08 06:29:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054100661] [2025-03-08 06:29:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:07,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:07,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:07,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:07,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:07,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:07,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054100661] [2025-03-08 06:29:07,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054100661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:07,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:07,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:07,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322069415] [2025-03-08 06:29:07,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:07,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:07,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:07,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:07,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:07,759 INFO L87 Difference]: Start difference. First operand 740 states and 1136 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:08,030 INFO L93 Difference]: Finished difference Result 1912 states and 2999 transitions. [2025-03-08 06:29:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:08,035 INFO L225 Difference]: With dead ends: 1912 [2025-03-08 06:29:08,035 INFO L226 Difference]: Without dead ends: 1752 [2025-03-08 06:29:08,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:08,037 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1815 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:08,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 3706 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-08 06:29:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 914. [2025-03-08 06:29:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 1.5487404162102958) internal successors, (1414), 913 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1414 transitions. [2025-03-08 06:29:08,055 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1414 transitions. Word has length 109 [2025-03-08 06:29:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:08,055 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1414 transitions. [2025-03-08 06:29:08,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1414 transitions. [2025-03-08 06:29:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:08,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:08,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:08,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:29:08,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:08,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash -217866163, now seen corresponding path program 1 times [2025-03-08 06:29:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959514220] [2025-03-08 06:29:08,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:08,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:08,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:08,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:08,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959514220] [2025-03-08 06:29:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959514220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:08,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:08,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:08,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163446027] [2025-03-08 06:29:08,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:08,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:08,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:08,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:08,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:08,271 INFO L87 Difference]: Start difference. First operand 914 states and 1414 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:08,507 INFO L93 Difference]: Finished difference Result 2081 states and 3269 transitions. [2025-03-08 06:29:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:08,514 INFO L225 Difference]: With dead ends: 2081 [2025-03-08 06:29:08,515 INFO L226 Difference]: Without dead ends: 1921 [2025-03-08 06:29:08,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:08,517 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1922 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:08,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 3126 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-03-08 06:29:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1083. [2025-03-08 06:29:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.5563770794824399) internal successors, (1684), 1082 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1684 transitions. [2025-03-08 06:29:08,547 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1684 transitions. Word has length 109 [2025-03-08 06:29:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:08,547 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1684 transitions. [2025-03-08 06:29:08,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1684 transitions. [2025-03-08 06:29:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:08,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:08,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:08,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:29:08,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:08,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash -191754923, now seen corresponding path program 1 times [2025-03-08 06:29:08,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:08,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526776408] [2025-03-08 06:29:08,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:08,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:08,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:08,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:08,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:08,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526776408] [2025-03-08 06:29:08,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526776408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804385578] [2025-03-08 06:29:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:08,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:08,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:08,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:08,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:08,748 INFO L87 Difference]: Start difference. First operand 1083 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:08,972 INFO L93 Difference]: Finished difference Result 2245 states and 3531 transitions. [2025-03-08 06:29:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:08,978 INFO L225 Difference]: With dead ends: 2245 [2025-03-08 06:29:08,979 INFO L226 Difference]: Without dead ends: 2085 [2025-03-08 06:29:08,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:08,980 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2026 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:08,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 3136 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-08 06:29:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1247. [2025-03-08 06:29:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 1.5617977528089888) internal successors, (1946), 1246 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1946 transitions. [2025-03-08 06:29:09,015 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1946 transitions. Word has length 109 [2025-03-08 06:29:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:09,015 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1946 transitions. [2025-03-08 06:29:09,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1946 transitions. [2025-03-08 06:29:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:09,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:09,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:29:09,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1522138445, now seen corresponding path program 1 times [2025-03-08 06:29:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217649607] [2025-03-08 06:29:09,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:09,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:09,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:09,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:09,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217649607] [2025-03-08 06:29:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217649607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:09,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809881426] [2025-03-08 06:29:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:09,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:09,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:09,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:09,213 INFO L87 Difference]: Start difference. First operand 1247 states and 1946 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:09,425 INFO L93 Difference]: Finished difference Result 2404 states and 3785 transitions. [2025-03-08 06:29:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:09,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:09,431 INFO L225 Difference]: With dead ends: 2404 [2025-03-08 06:29:09,432 INFO L226 Difference]: Without dead ends: 2244 [2025-03-08 06:29:09,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:09,433 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 2129 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:09,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 3329 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-03-08 06:29:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1406. [2025-03-08 06:29:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.5658362989323844) internal successors, (2200), 1405 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2200 transitions. [2025-03-08 06:29:09,476 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2200 transitions. Word has length 109 [2025-03-08 06:29:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:09,476 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2200 transitions. [2025-03-08 06:29:09,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2200 transitions. [2025-03-08 06:29:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:09,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:09,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:09,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:29:09,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:09,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1729982701, now seen corresponding path program 1 times [2025-03-08 06:29:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565453766] [2025-03-08 06:29:09,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:09,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:09,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:09,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:09,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565453766] [2025-03-08 06:29:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565453766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:09,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736101802] [2025-03-08 06:29:09,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:09,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:09,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:09,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:09,676 INFO L87 Difference]: Start difference. First operand 1406 states and 2200 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:09,924 INFO L93 Difference]: Finished difference Result 2562 states and 4038 transitions. [2025-03-08 06:29:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:09,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:09,933 INFO L225 Difference]: With dead ends: 2562 [2025-03-08 06:29:09,933 INFO L226 Difference]: Without dead ends: 2402 [2025-03-08 06:29:09,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:09,939 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 2223 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:09,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 3724 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2025-03-08 06:29:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1564. [2025-03-08 06:29:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.5694177863083814) internal successors, (2453), 1563 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2453 transitions. [2025-03-08 06:29:10,006 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2453 transitions. Word has length 109 [2025-03-08 06:29:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:10,006 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2453 transitions. [2025-03-08 06:29:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2453 transitions. [2025-03-08 06:29:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:10,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:10,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:10,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:29:10,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1291262470, now seen corresponding path program 1 times [2025-03-08 06:29:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182226514] [2025-03-08 06:29:10,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:10,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:10,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:10,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:10,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182226514] [2025-03-08 06:29:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182226514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:29:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146069461] [2025-03-08 06:29:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:29:10,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:10,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:29:10,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:29:10,081 INFO L87 Difference]: Start difference. First operand 1564 states and 2453 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:10,125 INFO L93 Difference]: Finished difference Result 4144 states and 6563 transitions. [2025-03-08 06:29:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:29:10,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:10,132 INFO L225 Difference]: With dead ends: 4144 [2025-03-08 06:29:10,133 INFO L226 Difference]: Without dead ends: 2799 [2025-03-08 06:29:10,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:29:10,135 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:10,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 637 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:29:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2025-03-08 06:29:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2763. [2025-03-08 06:29:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.5658942795076032) internal successors, (4325), 2762 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4325 transitions. [2025-03-08 06:29:10,177 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4325 transitions. Word has length 109 [2025-03-08 06:29:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:10,178 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4325 transitions. [2025-03-08 06:29:10,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4325 transitions. [2025-03-08 06:29:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:10,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:10,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:29:10,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1290100621, now seen corresponding path program 1 times [2025-03-08 06:29:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922823163] [2025-03-08 06:29:10,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:10,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:10,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:10,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:10,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922823163] [2025-03-08 06:29:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922823163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:10,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:10,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105678513] [2025-03-08 06:29:10,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:10,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:10,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:10,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:10,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:10,514 INFO L87 Difference]: Start difference. First operand 2763 states and 4325 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:10,807 INFO L93 Difference]: Finished difference Result 5309 states and 8350 transitions. [2025-03-08 06:29:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:10,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:10,814 INFO L225 Difference]: With dead ends: 5309 [2025-03-08 06:29:10,815 INFO L226 Difference]: Without dead ends: 2765 [2025-03-08 06:29:10,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:10,818 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 660 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:10,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1226 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2025-03-08 06:29:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2763. [2025-03-08 06:29:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.562635771180304) internal successors, (4316), 2762 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4316 transitions. [2025-03-08 06:29:10,872 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4316 transitions. Word has length 109 [2025-03-08 06:29:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:10,872 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 4316 transitions. [2025-03-08 06:29:10,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4316 transitions. [2025-03-08 06:29:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:10,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:10,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:29:10,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1369657694, now seen corresponding path program 1 times [2025-03-08 06:29:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582505498] [2025-03-08 06:29:10,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:10,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:10,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:10,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:10,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:10,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582505498] [2025-03-08 06:29:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582505498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:10,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:10,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805336437] [2025-03-08 06:29:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:10,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:10,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:10,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:10,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:10,987 INFO L87 Difference]: Start difference. First operand 2763 states and 4316 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:11,193 INFO L93 Difference]: Finished difference Result 8111 states and 12741 transitions. [2025-03-08 06:29:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-08 06:29:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:11,206 INFO L225 Difference]: With dead ends: 8111 [2025-03-08 06:29:11,206 INFO L226 Difference]: Without dead ends: 5404 [2025-03-08 06:29:11,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:11,211 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1081 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:11,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 239 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2025-03-08 06:29:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5402. [2025-03-08 06:29:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.563784484354749) internal successors, (8446), 5401 states have internal predecessors, (8446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8446 transitions. [2025-03-08 06:29:11,288 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8446 transitions. Word has length 110 [2025-03-08 06:29:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:11,288 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8446 transitions. [2025-03-08 06:29:11,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8446 transitions. [2025-03-08 06:29:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:11,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:29:11,290 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1414332283, now seen corresponding path program 1 times [2025-03-08 06:29:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719635370] [2025-03-08 06:29:11,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:11,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:11,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:11,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:11,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719635370] [2025-03-08 06:29:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719635370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:11,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3759953] [2025-03-08 06:29:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:11,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:11,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:11,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:11,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:11,411 INFO L87 Difference]: Start difference. First operand 5402 states and 8446 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:11,550 INFO L93 Difference]: Finished difference Result 10736 states and 16821 transitions. [2025-03-08 06:29:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-08 06:29:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:11,559 INFO L225 Difference]: With dead ends: 10736 [2025-03-08 06:29:11,559 INFO L226 Difference]: Without dead ends: 5402 [2025-03-08 06:29:11,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:11,565 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 706 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:11,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 174 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-08 06:29:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-08 06:29:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.551009072394001) internal successors, (8377), 5401 states have internal predecessors, (8377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8377 transitions. [2025-03-08 06:29:11,648 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8377 transitions. Word has length 111 [2025-03-08 06:29:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:11,649 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8377 transitions. [2025-03-08 06:29:11,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8377 transitions. [2025-03-08 06:29:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:11,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:11,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:11,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:29:11,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1152912738, now seen corresponding path program 1 times [2025-03-08 06:29:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256882450] [2025-03-08 06:29:11,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:11,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:11,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:11,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256882450] [2025-03-08 06:29:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256882450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:11,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753406815] [2025-03-08 06:29:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:11,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:11,756 INFO L87 Difference]: Start difference. First operand 5402 states and 8377 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:11,934 INFO L93 Difference]: Finished difference Result 10724 states and 16669 transitions. [2025-03-08 06:29:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-08 06:29:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:11,948 INFO L225 Difference]: With dead ends: 10724 [2025-03-08 06:29:11,948 INFO L226 Difference]: Without dead ends: 5402 [2025-03-08 06:29:11,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:11,952 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 667 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:11,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 202 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-08 06:29:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-08 06:29:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.5382336604332532) internal successors, (8308), 5401 states have internal predecessors, (8308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8308 transitions. [2025-03-08 06:29:12,024 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8308 transitions. Word has length 112 [2025-03-08 06:29:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:12,025 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8308 transitions. [2025-03-08 06:29:12,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8308 transitions. [2025-03-08 06:29:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:29:12,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:12,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:12,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:29:12,028 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:12,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 228299647, now seen corresponding path program 1 times [2025-03-08 06:29:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652032511] [2025-03-08 06:29:12,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:12,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:29:12,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:29:12,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:12,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652032511] [2025-03-08 06:29:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652032511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790360995] [2025-03-08 06:29:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:12,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:12,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:12,127 INFO L87 Difference]: Start difference. First operand 5402 states and 8308 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:12,291 INFO L93 Difference]: Finished difference Result 10732 states and 16541 transitions. [2025-03-08 06:29:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:12,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-08 06:29:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:12,301 INFO L225 Difference]: With dead ends: 10732 [2025-03-08 06:29:12,301 INFO L226 Difference]: Without dead ends: 5402 [2025-03-08 06:29:12,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:12,308 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 682 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:12,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 182 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-08 06:29:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-08 06:29:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.525458248472505) internal successors, (8239), 5401 states have internal predecessors, (8239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8239 transitions. [2025-03-08 06:29:12,389 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8239 transitions. Word has length 113 [2025-03-08 06:29:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:12,390 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8239 transitions. [2025-03-08 06:29:12,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8239 transitions. [2025-03-08 06:29:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:29:12,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:12,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:29:12,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:12,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1611948994, now seen corresponding path program 1 times [2025-03-08 06:29:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225192915] [2025-03-08 06:29:12,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:12,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:29:12,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:29:12,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:12,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:12,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225192915] [2025-03-08 06:29:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225192915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:12,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:12,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132683747] [2025-03-08 06:29:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:12,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:12,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:12,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:12,523 INFO L87 Difference]: Start difference. First operand 5402 states and 8239 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:12,669 INFO L93 Difference]: Finished difference Result 10744 states and 16417 transitions. [2025-03-08 06:29:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-08 06:29:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:12,678 INFO L225 Difference]: With dead ends: 10744 [2025-03-08 06:29:12,678 INFO L226 Difference]: Without dead ends: 5402 [2025-03-08 06:29:12,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:12,685 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 710 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:12,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 158 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-08 06:29:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-08 06:29:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.512682836511757) internal successors, (8170), 5401 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8170 transitions. [2025-03-08 06:29:12,765 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8170 transitions. Word has length 114 [2025-03-08 06:29:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:12,765 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8170 transitions. [2025-03-08 06:29:12,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8170 transitions. [2025-03-08 06:29:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 06:29:12,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:12,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:12,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:29:12,768 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:12,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1064258373, now seen corresponding path program 1 times [2025-03-08 06:29:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799977028] [2025-03-08 06:29:12,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:12,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:12,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 06:29:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 06:29:12,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799977028] [2025-03-08 06:29:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799977028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:12,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:12,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:12,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372310093] [2025-03-08 06:29:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:12,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:12,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:12,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:12,859 INFO L87 Difference]: Start difference. First operand 5402 states and 8170 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:13,006 INFO L93 Difference]: Finished difference Result 10740 states and 16275 transitions. [2025-03-08 06:29:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:13,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-08 06:29:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:13,014 INFO L225 Difference]: With dead ends: 10740 [2025-03-08 06:29:13,015 INFO L226 Difference]: Without dead ends: 5402 [2025-03-08 06:29:13,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:13,021 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 692 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:13,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 166 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-08 06:29:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-08 06:29:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.4999074245510091) internal successors, (8101), 5401 states have internal predecessors, (8101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8101 transitions. [2025-03-08 06:29:13,109 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8101 transitions. Word has length 115 [2025-03-08 06:29:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:13,109 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8101 transitions. [2025-03-08 06:29:13,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8101 transitions. [2025-03-08 06:29:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 06:29:13,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:13,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:29:13,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -772152774, now seen corresponding path program 1 times [2025-03-08 06:29:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227486731] [2025-03-08 06:29:13,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:13,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 06:29:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 06:29:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:13,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:13,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:13,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227486731] [2025-03-08 06:29:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227486731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:13,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:13,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:13,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398738976] [2025-03-08 06:29:13,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:13,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:13,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:13,228 INFO L87 Difference]: Start difference. First operand 5402 states and 8101 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:13,355 INFO L93 Difference]: Finished difference Result 10728 states and 16125 transitions. [2025-03-08 06:29:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:13,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-08 06:29:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:13,364 INFO L225 Difference]: With dead ends: 10728 [2025-03-08 06:29:13,365 INFO L226 Difference]: Without dead ends: 5402 [2025-03-08 06:29:13,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:13,371 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 650 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:13,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 190 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-08 06:29:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5402. [2025-03-08 06:29:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.487132012590261) internal successors, (8032), 5401 states have internal predecessors, (8032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8032 transitions. [2025-03-08 06:29:13,443 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8032 transitions. Word has length 116 [2025-03-08 06:29:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:13,444 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8032 transitions. [2025-03-08 06:29:13,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8032 transitions. [2025-03-08 06:29:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 06:29:13,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:13,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:13,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:29:13,445 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:13,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1521594361, now seen corresponding path program 1 times [2025-03-08 06:29:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750231061] [2025-03-08 06:29:13,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:13,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 06:29:13,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 06:29:13,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:13,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:13,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:13,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750231061] [2025-03-08 06:29:13,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750231061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:13,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:13,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:29:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96851231] [2025-03-08 06:29:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:13,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:13,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:13,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:13,877 INFO L87 Difference]: Start difference. First operand 5402 states and 8032 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:14,503 INFO L93 Difference]: Finished difference Result 16011 states and 23808 transitions. [2025-03-08 06:29:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-08 06:29:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:14,519 INFO L225 Difference]: With dead ends: 16011 [2025-03-08 06:29:14,520 INFO L226 Difference]: Without dead ends: 10782 [2025-03-08 06:29:14,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:29:14,528 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1077 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:14,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 954 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10782 states. [2025-03-08 06:29:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10782 to 5402. [2025-03-08 06:29:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.48602110720237) internal successors, (8026), 5401 states have internal predecessors, (8026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8026 transitions. [2025-03-08 06:29:14,616 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8026 transitions. Word has length 117 [2025-03-08 06:29:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:14,616 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8026 transitions. [2025-03-08 06:29:14,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8026 transitions. [2025-03-08 06:29:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 06:29:14,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:14,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:29:14,619 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:14,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 607749300, now seen corresponding path program 1 times [2025-03-08 06:29:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222476773] [2025-03-08 06:29:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:14,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 06:29:14,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 06:29:14,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:14,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222476773] [2025-03-08 06:29:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222476773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:29:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803559421] [2025-03-08 06:29:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:29:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:14,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:29:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:14,976 INFO L87 Difference]: Start difference. First operand 5402 states and 8026 transitions. Second operand has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:15,697 INFO L93 Difference]: Finished difference Result 16185 states and 23949 transitions. [2025-03-08 06:29:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:29:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-08 06:29:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:15,717 INFO L225 Difference]: With dead ends: 16185 [2025-03-08 06:29:15,717 INFO L226 Difference]: Without dead ends: 11013 [2025-03-08 06:29:15,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:29:15,725 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1143 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:15,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1012 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11013 states. [2025-03-08 06:29:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11013 to 5435. [2025-03-08 06:29:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.4841737210158263) internal successors, (8065), 5434 states have internal predecessors, (8065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 8065 transitions. [2025-03-08 06:29:15,824 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 8065 transitions. Word has length 118 [2025-03-08 06:29:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 8065 transitions. [2025-03-08 06:29:15,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 8065 transitions. [2025-03-08 06:29:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 06:29:15,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:15,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:15,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:29:15,826 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:15,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash 518136492, now seen corresponding path program 1 times [2025-03-08 06:29:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:15,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206593089] [2025-03-08 06:29:15,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:15,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 06:29:15,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 06:29:15,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:15,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:16,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:16,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206593089] [2025-03-08 06:29:16,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206593089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:16,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:16,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:29:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425940575] [2025-03-08 06:29:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:16,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:16,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:16,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:16,212 INFO L87 Difference]: Start difference. First operand 5435 states and 8065 transitions. Second operand has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:16,816 INFO L93 Difference]: Finished difference Result 15824 states and 23489 transitions. [2025-03-08 06:29:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-08 06:29:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:16,832 INFO L225 Difference]: With dead ends: 15824 [2025-03-08 06:29:16,832 INFO L226 Difference]: Without dead ends: 10725 [2025-03-08 06:29:16,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:29:16,839 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1051 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:16,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 936 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2025-03-08 06:29:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 5435. [2025-03-08 06:29:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.4817813765182186) internal successors, (8052), 5434 states have internal predecessors, (8052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 8052 transitions. [2025-03-08 06:29:16,918 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 8052 transitions. Word has length 118 [2025-03-08 06:29:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:16,919 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 8052 transitions. [2025-03-08 06:29:16,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 12 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 8052 transitions. [2025-03-08 06:29:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:29:16,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:16,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:16,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:29:16,920 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:16,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2012397017, now seen corresponding path program 1 times [2025-03-08 06:29:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:16,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736164018] [2025-03-08 06:29:16,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:16,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:29:16,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:29:16,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:16,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736164018] [2025-03-08 06:29:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736164018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886161268] [2025-03-08 06:29:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:17,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:17,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:17,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:17,171 INFO L87 Difference]: Start difference. First operand 5435 states and 8052 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:17,479 INFO L93 Difference]: Finished difference Result 15715 states and 23382 transitions. [2025-03-08 06:29:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 06:29:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:17,493 INFO L225 Difference]: With dead ends: 15715 [2025-03-08 06:29:17,494 INFO L226 Difference]: Without dead ends: 10521 [2025-03-08 06:29:17,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:29:17,500 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 577 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:17,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 645 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10521 states. [2025-03-08 06:29:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10521 to 5435. [2025-03-08 06:29:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 5434 states have (on average 1.4815973500184028) internal successors, (8051), 5434 states have internal predecessors, (8051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 8051 transitions. [2025-03-08 06:29:17,566 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 8051 transitions. Word has length 119 [2025-03-08 06:29:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:17,566 INFO L471 AbstractCegarLoop]: Abstraction has 5435 states and 8051 transitions. [2025-03-08 06:29:17,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 8051 transitions. [2025-03-08 06:29:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 06:29:17,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:17,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:17,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:29:17,568 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:17,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1358067236, now seen corresponding path program 1 times [2025-03-08 06:29:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521144628] [2025-03-08 06:29:17,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:17,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 06:29:17,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 06:29:17,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:17,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521144628] [2025-03-08 06:29:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521144628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:17,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879122779] [2025-03-08 06:29:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:17,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:17,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:17,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:17,965 INFO L87 Difference]: Start difference. First operand 5435 states and 8051 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:18,435 INFO L93 Difference]: Finished difference Result 16008 states and 23742 transitions. [2025-03-08 06:29:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-08 06:29:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:18,446 INFO L225 Difference]: With dead ends: 16008 [2025-03-08 06:29:18,446 INFO L226 Difference]: Without dead ends: 10809 [2025-03-08 06:29:18,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:29:18,452 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1340 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:18,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 809 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10809 states. [2025-03-08 06:29:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10809 to 5402. [2025-03-08 06:29:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5402 states, 5401 states have (on average 1.4817626365487873) internal successors, (8003), 5401 states have internal predecessors, (8003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 8003 transitions. [2025-03-08 06:29:18,515 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 8003 transitions. Word has length 120 [2025-03-08 06:29:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:18,515 INFO L471 AbstractCegarLoop]: Abstraction has 5402 states and 8003 transitions. [2025-03-08 06:29:18,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 8003 transitions. [2025-03-08 06:29:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 06:29:18,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:18,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:18,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:29:18,517 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:18,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1198907108, now seen corresponding path program 1 times [2025-03-08 06:29:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:18,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101041310] [2025-03-08 06:29:18,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:18,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 06:29:18,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 06:29:18,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:18,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:18,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101041310] [2025-03-08 06:29:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101041310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:18,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:18,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:29:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863229553] [2025-03-08 06:29:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:29:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:18,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:29:18,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:18,844 INFO L87 Difference]: Start difference. First operand 5402 states and 8003 transitions. Second operand has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:19,498 INFO L93 Difference]: Finished difference Result 16288 states and 24030 transitions. [2025-03-08 06:29:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:29:19,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-08 06:29:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:19,511 INFO L225 Difference]: With dead ends: 16288 [2025-03-08 06:29:19,512 INFO L226 Difference]: Without dead ends: 11202 [2025-03-08 06:29:19,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:29:19,517 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1662 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:19,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 1255 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11202 states. [2025-03-08 06:29:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11202 to 5599. [2025-03-08 06:29:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5599 states, 5598 states have (on average 1.4790996784565917) internal successors, (8280), 5598 states have internal predecessors, (8280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 8280 transitions. [2025-03-08 06:29:19,588 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 8280 transitions. Word has length 120 [2025-03-08 06:29:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:19,589 INFO L471 AbstractCegarLoop]: Abstraction has 5599 states and 8280 transitions. [2025-03-08 06:29:19,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 8280 transitions. [2025-03-08 06:29:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:29:19,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:19,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:29:19,591 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1842268769, now seen corresponding path program 1 times [2025-03-08 06:29:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090351703] [2025-03-08 06:29:19,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:19,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:29:19,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:29:19,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:19,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:20,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090351703] [2025-03-08 06:29:20,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090351703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:20,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:20,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:29:20,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401045869] [2025-03-08 06:29:20,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:20,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:20,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:20,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:20,067 INFO L87 Difference]: Start difference. First operand 5599 states and 8280 transitions. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:21,130 INFO L93 Difference]: Finished difference Result 34229 states and 50600 transitions. [2025-03-08 06:29:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:29:21,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-08 06:29:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:21,171 INFO L225 Difference]: With dead ends: 34229 [2025-03-08 06:29:21,171 INFO L226 Difference]: Without dead ends: 28986 [2025-03-08 06:29:21,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:29:21,184 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1953 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:21,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 1624 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28986 states. [2025-03-08 06:29:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28986 to 5644. [2025-03-08 06:29:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5644 states, 5643 states have (on average 1.4743930533404217) internal successors, (8320), 5643 states have internal predecessors, (8320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5644 states to 5644 states and 8320 transitions. [2025-03-08 06:29:21,371 INFO L78 Accepts]: Start accepts. Automaton has 5644 states and 8320 transitions. Word has length 121 [2025-03-08 06:29:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:21,371 INFO L471 AbstractCegarLoop]: Abstraction has 5644 states and 8320 transitions. [2025-03-08 06:29:21,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 12 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5644 states and 8320 transitions. [2025-03-08 06:29:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:29:21,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:21,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:21,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:29:21,373 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:21,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash 552531868, now seen corresponding path program 1 times [2025-03-08 06:29:21,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:21,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015947197] [2025-03-08 06:29:21,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:21,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:21,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:29:21,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:29:21,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:21,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:21,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015947197] [2025-03-08 06:29:21,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015947197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:21,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:21,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669571137] [2025-03-08 06:29:21,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:21,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:21,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:21,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:21,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:21,571 INFO L87 Difference]: Start difference. First operand 5644 states and 8320 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:21,989 INFO L93 Difference]: Finished difference Result 16233 states and 24006 transitions. [2025-03-08 06:29:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:21,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-08 06:29:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:21,999 INFO L225 Difference]: With dead ends: 16233 [2025-03-08 06:29:21,999 INFO L226 Difference]: Without dead ends: 11147 [2025-03-08 06:29:22,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:22,005 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 794 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1013 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2025-03-08 06:29:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 5474. [2025-03-08 06:29:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5474 states, 5473 states have (on average 1.4778001096290883) internal successors, (8088), 5473 states have internal predecessors, (8088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5474 states to 5474 states and 8088 transitions. [2025-03-08 06:29:22,073 INFO L78 Accepts]: Start accepts. Automaton has 5474 states and 8088 transitions. Word has length 122 [2025-03-08 06:29:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:22,074 INFO L471 AbstractCegarLoop]: Abstraction has 5474 states and 8088 transitions. [2025-03-08 06:29:22,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5474 states and 8088 transitions. [2025-03-08 06:29:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 06:29:22,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:22,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:22,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:29:22,075 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:22,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 565850676, now seen corresponding path program 1 times [2025-03-08 06:29:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868158390] [2025-03-08 06:29:22,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:22,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:22,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 06:29:22,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 06:29:22,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:22,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868158390] [2025-03-08 06:29:22,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868158390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:22,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:22,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:22,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977287842] [2025-03-08 06:29:22,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:22,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:22,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:22,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:22,279 INFO L87 Difference]: Start difference. First operand 5474 states and 8088 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:22,757 INFO L93 Difference]: Finished difference Result 11507 states and 16998 transitions. [2025-03-08 06:29:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:22,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-03-08 06:29:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:22,762 INFO L225 Difference]: With dead ends: 11507 [2025-03-08 06:29:22,762 INFO L226 Difference]: Without dead ends: 6206 [2025-03-08 06:29:22,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:29:22,765 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 550 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1110 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2025-03-08 06:29:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5474. [2025-03-08 06:29:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5474 states, 5473 states have (on average 1.4772519641878312) internal successors, (8085), 5473 states have internal predecessors, (8085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5474 states to 5474 states and 8085 transitions. [2025-03-08 06:29:22,816 INFO L78 Accepts]: Start accepts. Automaton has 5474 states and 8085 transitions. Word has length 122 [2025-03-08 06:29:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:22,816 INFO L471 AbstractCegarLoop]: Abstraction has 5474 states and 8085 transitions. [2025-03-08 06:29:22,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5474 states and 8085 transitions. [2025-03-08 06:29:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:22,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:22,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:22,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:29:22,818 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1733842326, now seen corresponding path program 1 times [2025-03-08 06:29:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941487017] [2025-03-08 06:29:22,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:22,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:22,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:22,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:22,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941487017] [2025-03-08 06:29:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941487017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:29:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625111267] [2025-03-08 06:29:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:29:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:22,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:29:22,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:29:22,895 INFO L87 Difference]: Start difference. First operand 5474 states and 8085 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:22,936 INFO L93 Difference]: Finished difference Result 15374 states and 22919 transitions. [2025-03-08 06:29:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:29:22,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:22,950 INFO L225 Difference]: With dead ends: 15374 [2025-03-08 06:29:22,950 INFO L226 Difference]: Without dead ends: 10288 [2025-03-08 06:29:22,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:29:22,959 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 132 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 556 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:29:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2025-03-08 06:29:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 10014. [2025-03-08 06:29:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10014 states, 10013 states have (on average 1.4752821332268051) internal successors, (14772), 10013 states have internal predecessors, (14772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10014 states to 10014 states and 14772 transitions. [2025-03-08 06:29:23,090 INFO L78 Accepts]: Start accepts. Automaton has 10014 states and 14772 transitions. Word has length 123 [2025-03-08 06:29:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:23,090 INFO L471 AbstractCegarLoop]: Abstraction has 10014 states and 14772 transitions. [2025-03-08 06:29:23,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 10014 states and 14772 transitions. [2025-03-08 06:29:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:23,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:23,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:29:23,092 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash -874864490, now seen corresponding path program 1 times [2025-03-08 06:29:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:23,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573260101] [2025-03-08 06:29:23,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:23,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:23,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:23,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:23,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:23,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573260101] [2025-03-08 06:29:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573260101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:29:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200493545] [2025-03-08 06:29:23,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:23,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:29:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:23,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:29:23,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:23,665 INFO L87 Difference]: Start difference. First operand 10014 states and 14772 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:24,496 INFO L93 Difference]: Finished difference Result 24453 states and 36146 transitions. [2025-03-08 06:29:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:29:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:24,517 INFO L225 Difference]: With dead ends: 24453 [2025-03-08 06:29:24,517 INFO L226 Difference]: Without dead ends: 22084 [2025-03-08 06:29:24,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:29:24,524 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1164 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:24,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4734 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:29:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22084 states. [2025-03-08 06:29:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 9947. [2025-03-08 06:29:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9947 states, 9946 states have (on average 1.475869696360346) internal successors, (14679), 9946 states have internal predecessors, (14679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9947 states to 9947 states and 14679 transitions. [2025-03-08 06:29:24,668 INFO L78 Accepts]: Start accepts. Automaton has 9947 states and 14679 transitions. Word has length 123 [2025-03-08 06:29:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:24,668 INFO L471 AbstractCegarLoop]: Abstraction has 9947 states and 14679 transitions. [2025-03-08 06:29:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9947 states and 14679 transitions. [2025-03-08 06:29:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:24,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:24,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:24,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:29:24,669 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:24,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash -143545039, now seen corresponding path program 1 times [2025-03-08 06:29:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:24,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945173146] [2025-03-08 06:29:24,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:24,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:24,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:24,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:24,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:25,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945173146] [2025-03-08 06:29:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945173146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:25,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:29:25,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278059921] [2025-03-08 06:29:25,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:25,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:25,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:25,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:25,128 INFO L87 Difference]: Start difference. First operand 9947 states and 14679 transitions. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:25,630 INFO L93 Difference]: Finished difference Result 22020 states and 32569 transitions. [2025-03-08 06:29:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:25,649 INFO L225 Difference]: With dead ends: 22020 [2025-03-08 06:29:25,649 INFO L226 Difference]: Without dead ends: 19674 [2025-03-08 06:29:25,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:29:25,655 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 921 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:25,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2492 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19674 states. [2025-03-08 06:29:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19674 to 9890. [2025-03-08 06:29:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9890 states, 9889 states have (on average 1.476387905753868) internal successors, (14600), 9889 states have internal predecessors, (14600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9890 states to 9890 states and 14600 transitions. [2025-03-08 06:29:25,770 INFO L78 Accepts]: Start accepts. Automaton has 9890 states and 14600 transitions. Word has length 123 [2025-03-08 06:29:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:25,770 INFO L471 AbstractCegarLoop]: Abstraction has 9890 states and 14600 transitions. [2025-03-08 06:29:25,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 9890 states and 14600 transitions. [2025-03-08 06:29:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:25,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:25,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:25,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:29:25,772 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:25,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash 398503081, now seen corresponding path program 1 times [2025-03-08 06:29:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:25,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675028842] [2025-03-08 06:29:25,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:25,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:25,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:25,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:25,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:25,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:28,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675028842] [2025-03-08 06:29:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675028842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2025-03-08 06:29:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210684173] [2025-03-08 06:29:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:28,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 06:29:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:28,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 06:29:28,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1917, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 06:29:28,907 INFO L87 Difference]: Start difference. First operand 9890 states and 14600 transitions. Second operand has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:37,889 INFO L93 Difference]: Finished difference Result 27638 states and 40878 transitions. [2025-03-08 06:29:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 06:29:37,890 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:37,914 INFO L225 Difference]: With dead ends: 27638 [2025-03-08 06:29:37,914 INFO L226 Difference]: Without dead ends: 26504 [2025-03-08 06:29:37,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1037, Invalid=6445, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 06:29:37,923 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 2675 mSDsluCounter, 17417 mSDsCounter, 0 mSdLazyCounter, 12226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2675 SdHoareTripleChecker+Valid, 18124 SdHoareTripleChecker+Invalid, 12255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 12226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:37,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2675 Valid, 18124 Invalid, 12255 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 12226 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-08 06:29:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26504 states. [2025-03-08 06:29:38,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26504 to 9941. [2025-03-08 06:29:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9941 states, 9940 states have (on average 1.4756539235412476) internal successors, (14668), 9940 states have internal predecessors, (14668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 14668 transitions. [2025-03-08 06:29:38,052 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 14668 transitions. Word has length 123 [2025-03-08 06:29:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:38,052 INFO L471 AbstractCegarLoop]: Abstraction has 9941 states and 14668 transitions. [2025-03-08 06:29:38,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 14668 transitions. [2025-03-08 06:29:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:38,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:38,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:38,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:29:38,053 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:38,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 21726081, now seen corresponding path program 1 times [2025-03-08 06:29:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552193700] [2025-03-08 06:29:38,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:38,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:38,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:38,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:38,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:38,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552193700] [2025-03-08 06:29:38,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552193700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:38,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:38,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:29:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282728278] [2025-03-08 06:29:38,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:38,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:29:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:38,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:29:38,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:38,513 INFO L87 Difference]: Start difference. First operand 9941 states and 14668 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:39,096 INFO L93 Difference]: Finished difference Result 41254 states and 61106 transitions. [2025-03-08 06:29:39,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:29:39,096 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:39,136 INFO L225 Difference]: With dead ends: 41254 [2025-03-08 06:29:39,136 INFO L226 Difference]: Without dead ends: 38936 [2025-03-08 06:29:39,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:29:39,149 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1166 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:39,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 3623 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38936 states. [2025-03-08 06:29:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38936 to 9906. [2025-03-08 06:29:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9906 states, 9905 states have (on average 1.475517415446744) internal successors, (14615), 9905 states have internal predecessors, (14615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 14615 transitions. [2025-03-08 06:29:39,368 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 14615 transitions. Word has length 123 [2025-03-08 06:29:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:39,369 INFO L471 AbstractCegarLoop]: Abstraction has 9906 states and 14615 transitions. [2025-03-08 06:29:39,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 14 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 14615 transitions. [2025-03-08 06:29:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:39,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:39,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:39,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:29:39,370 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash -379638183, now seen corresponding path program 1 times [2025-03-08 06:29:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:39,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637277727] [2025-03-08 06:29:39,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:39,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:39,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:39,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:39,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637277727] [2025-03-08 06:29:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637277727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:39,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:29:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578771504] [2025-03-08 06:29:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:39,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:39,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:39,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:39,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:39,797 INFO L87 Difference]: Start difference. First operand 9906 states and 14615 transitions. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:40,205 INFO L93 Difference]: Finished difference Result 21880 states and 32373 transitions. [2025-03-08 06:29:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:40,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:40,224 INFO L225 Difference]: With dead ends: 21880 [2025-03-08 06:29:40,224 INFO L226 Difference]: Without dead ends: 19553 [2025-03-08 06:29:40,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:29:40,232 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1090 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:40,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 2303 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19553 states. [2025-03-08 06:29:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19553 to 9848. [2025-03-08 06:29:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9848 states, 9847 states have (on average 1.4765918553874275) internal successors, (14540), 9847 states have internal predecessors, (14540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 14540 transitions. [2025-03-08 06:29:40,373 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 14540 transitions. Word has length 123 [2025-03-08 06:29:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:40,373 INFO L471 AbstractCegarLoop]: Abstraction has 9848 states and 14540 transitions. [2025-03-08 06:29:40,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 14540 transitions. [2025-03-08 06:29:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:40,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:40,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:40,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:29:40,374 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:40,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1438993215, now seen corresponding path program 1 times [2025-03-08 06:29:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213948113] [2025-03-08 06:29:40,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:40,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:40,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:40,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:40,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213948113] [2025-03-08 06:29:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213948113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:40,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:29:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082154345] [2025-03-08 06:29:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:40,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:29:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:40,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:29:40,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:29:40,609 INFO L87 Difference]: Start difference. First operand 9848 states and 14540 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:41,150 INFO L93 Difference]: Finished difference Result 29456 states and 43489 transitions. [2025-03-08 06:29:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:41,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:41,167 INFO L225 Difference]: With dead ends: 29456 [2025-03-08 06:29:41,167 INFO L226 Difference]: Without dead ends: 19791 [2025-03-08 06:29:41,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:29:41,177 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1003 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:41,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1045 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19791 states. [2025-03-08 06:29:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19791 to 9839. [2025-03-08 06:29:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9839 states, 9838 states have (on average 1.4767229111608051) internal successors, (14528), 9838 states have internal predecessors, (14528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 14528 transitions. [2025-03-08 06:29:41,314 INFO L78 Accepts]: Start accepts. Automaton has 9839 states and 14528 transitions. Word has length 123 [2025-03-08 06:29:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:41,314 INFO L471 AbstractCegarLoop]: Abstraction has 9839 states and 14528 transitions. [2025-03-08 06:29:41,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 9839 states and 14528 transitions. [2025-03-08 06:29:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:41,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:41,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:41,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:29:41,315 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:41,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1282090721, now seen corresponding path program 1 times [2025-03-08 06:29:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:41,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117201961] [2025-03-08 06:29:41,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:41,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:41,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:41,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:41,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:41,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:44,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117201961] [2025-03-08 06:29:44,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117201961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:44,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:44,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2025-03-08 06:29:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092253111] [2025-03-08 06:29:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:44,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 06:29:44,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:44,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 06:29:44,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1925, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 06:29:44,260 INFO L87 Difference]: Start difference. First operand 9839 states and 14528 transitions. Second operand has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:53,138 INFO L93 Difference]: Finished difference Result 17890 states and 26414 transitions. [2025-03-08 06:29:53,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 06:29:53,139 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:53,154 INFO L225 Difference]: With dead ends: 17890 [2025-03-08 06:29:53,154 INFO L226 Difference]: Without dead ends: 16756 [2025-03-08 06:29:53,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 06:29:53,160 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 2965 mSDsluCounter, 16449 mSDsCounter, 0 mSdLazyCounter, 11611 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2965 SdHoareTripleChecker+Valid, 17176 SdHoareTripleChecker+Invalid, 11634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:53,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2965 Valid, 17176 Invalid, 11634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 11611 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-08 06:29:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16756 states. [2025-03-08 06:29:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16756 to 9868. [2025-03-08 06:29:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9868 states, 9867 states have (on average 1.47603121516165) internal successors, (14564), 9867 states have internal predecessors, (14564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9868 states to 9868 states and 14564 transitions. [2025-03-08 06:29:53,267 INFO L78 Accepts]: Start accepts. Automaton has 9868 states and 14564 transitions. Word has length 123 [2025-03-08 06:29:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:53,268 INFO L471 AbstractCegarLoop]: Abstraction has 9868 states and 14564 transitions. [2025-03-08 06:29:53,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 46 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9868 states and 14564 transitions. [2025-03-08 06:29:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 06:29:53,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:53,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:53,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:29:53,269 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:53,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1562117898, now seen corresponding path program 1 times [2025-03-08 06:29:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353200763] [2025-03-08 06:29:53,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:53,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 06:29:53,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 06:29:53,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:53,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:53,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353200763] [2025-03-08 06:29:53,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353200763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:53,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:53,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:29:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557304398] [2025-03-08 06:29:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:53,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:53,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:53,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:53,655 INFO L87 Difference]: Start difference. First operand 9868 states and 14564 transitions. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:53,956 INFO L93 Difference]: Finished difference Result 21760 states and 32222 transitions. [2025-03-08 06:29:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 06:29:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:53,975 INFO L225 Difference]: With dead ends: 21760 [2025-03-08 06:29:53,975 INFO L226 Difference]: Without dead ends: 19432 [2025-03-08 06:29:53,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:29:53,982 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 868 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:53,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1425 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19432 states. [2025-03-08 06:29:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19432 to 9806. [2025-03-08 06:29:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9806 states, 9805 states have (on average 1.4776134625191228) internal successors, (14488), 9805 states have internal predecessors, (14488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9806 states to 9806 states and 14488 transitions. [2025-03-08 06:29:54,114 INFO L78 Accepts]: Start accepts. Automaton has 9806 states and 14488 transitions. Word has length 123 [2025-03-08 06:29:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:54,114 INFO L471 AbstractCegarLoop]: Abstraction has 9806 states and 14488 transitions. [2025-03-08 06:29:54,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 9806 states and 14488 transitions. [2025-03-08 06:29:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:29:54,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:54,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:54,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:29:54,115 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:54,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2032136526, now seen corresponding path program 1 times [2025-03-08 06:29:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196723552] [2025-03-08 06:29:54,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:54,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:29:54,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:29:54,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:54,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196723552] [2025-03-08 06:29:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196723552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:29:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873967744] [2025-03-08 06:29:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:54,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:29:54,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:29:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:54,564 INFO L87 Difference]: Start difference. First operand 9806 states and 14488 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:54,987 INFO L93 Difference]: Finished difference Result 21716 states and 32168 transitions. [2025-03-08 06:29:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:29:54,988 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-08 06:29:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:55,006 INFO L225 Difference]: With dead ends: 21716 [2025-03-08 06:29:55,006 INFO L226 Difference]: Without dead ends: 19436 [2025-03-08 06:29:55,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:29:55,014 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1039 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:55,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 2189 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:29:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19436 states. [2025-03-08 06:29:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19436 to 9775. [2025-03-08 06:29:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9775 states, 9774 states have (on average 1.4783098015142213) internal successors, (14449), 9774 states have internal predecessors, (14449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 14449 transitions. [2025-03-08 06:29:55,134 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 14449 transitions. Word has length 124 [2025-03-08 06:29:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:55,134 INFO L471 AbstractCegarLoop]: Abstraction has 9775 states and 14449 transitions. [2025-03-08 06:29:55,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 14449 transitions. [2025-03-08 06:29:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:29:55,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:55,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:55,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:29:55,135 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:55,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:55,135 INFO L85 PathProgramCache]: Analyzing trace with hash -278484014, now seen corresponding path program 1 times [2025-03-08 06:29:55,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460363826] [2025-03-08 06:29:55,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:55,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:55,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:29:55,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:29:55,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:55,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:55,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:55,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460363826] [2025-03-08 06:29:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460363826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:29:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718224526] [2025-03-08 06:29:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:55,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:29:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:55,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:29:55,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:29:55,573 INFO L87 Difference]: Start difference. First operand 9775 states and 14449 transitions. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:56,151 INFO L93 Difference]: Finished difference Result 40935 states and 60709 transitions. [2025-03-08 06:29:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:29:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-08 06:29:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:56,191 INFO L225 Difference]: With dead ends: 40935 [2025-03-08 06:29:56,191 INFO L226 Difference]: Without dead ends: 38669 [2025-03-08 06:29:56,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:29:56,207 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 1255 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:56,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 4767 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38669 states. [2025-03-08 06:29:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38669 to 9779. [2025-03-08 06:29:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9779 states, 9778 states have (on average 1.4783186745755779) internal successors, (14455), 9778 states have internal predecessors, (14455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9779 states to 9779 states and 14455 transitions. [2025-03-08 06:29:56,433 INFO L78 Accepts]: Start accepts. Automaton has 9779 states and 14455 transitions. Word has length 124 [2025-03-08 06:29:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:56,433 INFO L471 AbstractCegarLoop]: Abstraction has 9779 states and 14455 transitions. [2025-03-08 06:29:56,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9779 states and 14455 transitions. [2025-03-08 06:29:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:29:56,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:56,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:56,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:29:56,434 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:56,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1806514987, now seen corresponding path program 1 times [2025-03-08 06:29:56,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:56,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297381156] [2025-03-08 06:29:56,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:56,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:29:56,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:29:56,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:56,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297381156] [2025-03-08 06:29:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297381156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:56,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299478874] [2025-03-08 06:29:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:56,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:29:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:56,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:29:56,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:29:56,531 INFO L87 Difference]: Start difference. First operand 9779 states and 14455 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:56,580 INFO L93 Difference]: Finished difference Result 23579 states and 34961 transitions. [2025-03-08 06:29:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:56,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-08 06:29:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:56,592 INFO L225 Difference]: With dead ends: 23579 [2025-03-08 06:29:56,593 INFO L226 Difference]: Without dead ends: 13953 [2025-03-08 06:29:56,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:56,600 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 115 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:56,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 588 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:29:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13953 states. [2025-03-08 06:29:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13953 to 13891. [2025-03-08 06:29:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13891 states, 13890 states have (on average 1.472930165586753) internal successors, (20459), 13890 states have internal predecessors, (20459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13891 states to 13891 states and 20459 transitions. [2025-03-08 06:29:56,722 INFO L78 Accepts]: Start accepts. Automaton has 13891 states and 20459 transitions. Word has length 124 [2025-03-08 06:29:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:56,722 INFO L471 AbstractCegarLoop]: Abstraction has 13891 states and 20459 transitions. [2025-03-08 06:29:56,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13891 states and 20459 transitions. [2025-03-08 06:29:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 06:29:56,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:56,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:29:56,723 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1774310916, now seen corresponding path program 1 times [2025-03-08 06:29:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755676575] [2025-03-08 06:29:56,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:56,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 06:29:56,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 06:29:56,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:56,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755676575] [2025-03-08 06:29:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755676575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:29:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290791694] [2025-03-08 06:29:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:56,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:56,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:56,936 INFO L87 Difference]: Start difference. First operand 13891 states and 20459 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:56,977 INFO L93 Difference]: Finished difference Result 13957 states and 20556 transitions. [2025-03-08 06:29:56,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:56,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-08 06:29:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:56,990 INFO L225 Difference]: With dead ends: 13957 [2025-03-08 06:29:56,990 INFO L226 Difference]: Without dead ends: 13955 [2025-03-08 06:29:56,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:56,994 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:56,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 961 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:29:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13955 states. [2025-03-08 06:29:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13955 to 13955. [2025-03-08 06:29:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13955 states, 13954 states have (on average 1.465887917443027) internal successors, (20455), 13954 states have internal predecessors, (20455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13955 states to 13955 states and 20455 transitions. [2025-03-08 06:29:57,107 INFO L78 Accepts]: Start accepts. Automaton has 13955 states and 20455 transitions. Word has length 124 [2025-03-08 06:29:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:57,108 INFO L471 AbstractCegarLoop]: Abstraction has 13955 states and 20455 transitions. [2025-03-08 06:29:57,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13955 states and 20455 transitions. [2025-03-08 06:29:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:29:57,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:57,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:57,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:29:57,110 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2014751236, now seen corresponding path program 1 times [2025-03-08 06:29:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:57,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281258524] [2025-03-08 06:29:57,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:57,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:29:57,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:29:57,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:57,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:57,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281258524] [2025-03-08 06:29:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281258524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:29:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273673818] [2025-03-08 06:29:57,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:57,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:29:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:57,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:29:57,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:57,236 INFO L87 Difference]: Start difference. First operand 13955 states and 20455 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:57,525 INFO L93 Difference]: Finished difference Result 47725 states and 70440 transitions. [2025-03-08 06:29:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:57,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-08 06:29:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:57,557 INFO L225 Difference]: With dead ends: 47725 [2025-03-08 06:29:57,557 INFO L226 Difference]: Without dead ends: 33923 [2025-03-08 06:29:57,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:57,573 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1070 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:57,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 621 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33923 states. [2025-03-08 06:29:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33923 to 20689. [2025-03-08 06:29:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20689 states, 20688 states have (on average 1.4675174013921113) internal successors, (30360), 20688 states have internal predecessors, (30360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20689 states to 20689 states and 30360 transitions. [2025-03-08 06:29:57,777 INFO L78 Accepts]: Start accepts. Automaton has 20689 states and 30360 transitions. Word has length 160 [2025-03-08 06:29:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:57,777 INFO L471 AbstractCegarLoop]: Abstraction has 20689 states and 30360 transitions. [2025-03-08 06:29:57,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 20689 states and 30360 transitions. [2025-03-08 06:29:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:29:57,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:57,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:57,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:29:57,779 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:57,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash -207215300, now seen corresponding path program 1 times [2025-03-08 06:29:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987023371] [2025-03-08 06:29:57,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:57,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:29:57,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:29:57,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:57,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987023371] [2025-03-08 06:29:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987023371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:57,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:29:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064225311] [2025-03-08 06:29:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:57,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:29:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:57,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:29:57,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:57,876 INFO L87 Difference]: Start difference. First operand 20689 states and 30360 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:58,234 INFO L93 Difference]: Finished difference Result 85973 states and 126822 transitions. [2025-03-08 06:29:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-08 06:29:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:58,302 INFO L225 Difference]: With dead ends: 85973 [2025-03-08 06:29:58,302 INFO L226 Difference]: Without dead ends: 65475 [2025-03-08 06:29:58,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:58,329 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1424 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:58,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 488 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65475 states. [2025-03-08 06:29:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65475 to 43825. [2025-03-08 06:29:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43825 states, 43824 states have (on average 1.4649963490324935) internal successors, (64202), 43824 states have internal predecessors, (64202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43825 states to 43825 states and 64202 transitions. [2025-03-08 06:29:58,935 INFO L78 Accepts]: Start accepts. Automaton has 43825 states and 64202 transitions. Word has length 160 [2025-03-08 06:29:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:58,935 INFO L471 AbstractCegarLoop]: Abstraction has 43825 states and 64202 transitions. [2025-03-08 06:29:58,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 43825 states and 64202 transitions. [2025-03-08 06:29:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:29:58,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:58,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:58,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:29:58,938 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:29:58,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 850171004, now seen corresponding path program 1 times [2025-03-08 06:29:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779962578] [2025-03-08 06:29:58,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:58,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:58,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:29:58,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:29:58,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:58,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:59,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779962578] [2025-03-08 06:29:59,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779962578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:59,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:59,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:29:59,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636588216] [2025-03-08 06:29:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:59,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:29:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:59,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:29:59,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:59,039 INFO L87 Difference]: Start difference. First operand 43825 states and 64202 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:59,645 INFO L93 Difference]: Finished difference Result 169109 states and 248676 transitions. [2025-03-08 06:29:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:29:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-08 06:29:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:59,783 INFO L225 Difference]: With dead ends: 169109 [2025-03-08 06:29:59,783 INFO L226 Difference]: Without dead ends: 125475 [2025-03-08 06:29:59,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:59,809 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1339 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:59,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 486 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:29:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125475 states. [2025-03-08 06:30:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125475 to 92737. [2025-03-08 06:30:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92737 states, 92736 states have (on average 1.4620212215320911) internal successors, (135582), 92736 states have internal predecessors, (135582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92737 states to 92737 states and 135582 transitions. [2025-03-08 06:30:00,954 INFO L78 Accepts]: Start accepts. Automaton has 92737 states and 135582 transitions. Word has length 160 [2025-03-08 06:30:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 92737 states and 135582 transitions. [2025-03-08 06:30:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 92737 states and 135582 transitions. [2025-03-08 06:30:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:00,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:00,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:00,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:30:00,959 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:00,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash -630467684, now seen corresponding path program 1 times [2025-03-08 06:30:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:00,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523222901] [2025-03-08 06:30:00,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:00,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:00,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:00,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:00,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:01,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523222901] [2025-03-08 06:30:01,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523222901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:01,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:30:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230915544] [2025-03-08 06:30:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:01,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:30:01,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:01,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:30:01,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:30:01,281 INFO L87 Difference]: Start difference. First operand 92737 states and 135582 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:02,157 INFO L93 Difference]: Finished difference Result 332741 states and 487632 transitions. [2025-03-08 06:30:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:02,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-08 06:30:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:02,517 INFO L225 Difference]: With dead ends: 332741 [2025-03-08 06:30:02,517 INFO L226 Difference]: Without dead ends: 240195 [2025-03-08 06:30:02,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:02,578 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1254 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:02,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 484 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:30:02,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240195 states. [2025-03-08 06:30:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240195 to 195841. [2025-03-08 06:30:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195841 states, 195840 states have (on average 1.459017565359477) internal successors, (285734), 195840 states have internal predecessors, (285734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195841 states to 195841 states and 285734 transitions. [2025-03-08 06:30:05,442 INFO L78 Accepts]: Start accepts. Automaton has 195841 states and 285734 transitions. Word has length 160 [2025-03-08 06:30:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:05,443 INFO L471 AbstractCegarLoop]: Abstraction has 195841 states and 285734 transitions. [2025-03-08 06:30:05,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 195841 states and 285734 transitions. [2025-03-08 06:30:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:05,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:05,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:05,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:30:05,448 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -913421444, now seen corresponding path program 1 times [2025-03-08 06:30:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:05,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99770399] [2025-03-08 06:30:05,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:05,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:05,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:05,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:05,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:05,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99770399] [2025-03-08 06:30:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99770399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:30:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278064907] [2025-03-08 06:30:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:30:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:05,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:30:05,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:30:05,718 INFO L87 Difference]: Start difference. First operand 195841 states and 285734 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:07,584 INFO L93 Difference]: Finished difference Result 654725 states and 956040 transitions. [2025-03-08 06:30:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:07,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-03-08 06:30:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:08,424 INFO L225 Difference]: With dead ends: 654725 [2025-03-08 06:30:08,424 INFO L226 Difference]: Without dead ends: 459075 [2025-03-08 06:30:08,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:30:08,502 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1169 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:08,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 482 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:30:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459075 states. [2025-03-08 06:30:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459075 to 412609. [2025-03-08 06:30:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412609 states, 412608 states have (on average 1.456156933457422) internal successors, (600822), 412608 states have internal predecessors, (600822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412609 states to 412609 states and 600822 transitions. [2025-03-08 06:30:14,169 INFO L78 Accepts]: Start accepts. Automaton has 412609 states and 600822 transitions. Word has length 160 [2025-03-08 06:30:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:14,169 INFO L471 AbstractCegarLoop]: Abstraction has 412609 states and 600822 transitions. [2025-03-08 06:30:14,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 412609 states and 600822 transitions. [2025-03-08 06:30:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 06:30:14,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:14,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:30:14,175 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:30:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2032494434, now seen corresponding path program 1 times [2025-03-08 06:30:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626522469] [2025-03-08 06:30:14,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:14,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:14,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:14,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:14,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626522469] [2025-03-08 06:30:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626522469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:30:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036184050] [2025-03-08 06:30:14,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:14,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:30:14,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:30:14,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:30:14,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:30:14,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 06:30:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 06:30:14,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:14,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:14,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:30:14,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:30:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:15,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:30:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:15,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036184050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:30:15,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:30:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 06:30:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876006138] [2025-03-08 06:30:15,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:30:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:30:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:15,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:30:15,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:30:15,401 INFO L87 Difference]: Start difference. First operand 412609 states and 600822 transitions. Second operand has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 10 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:19,368 INFO L93 Difference]: Finished difference Result 1288133 states and 1873848 transitions. [2025-03-08 06:30:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:30:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.90909090909091) internal successors, (285), 10 states have internal predecessors, (285), 0 states have call successors, (0), 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 160 [2025-03-08 06:30:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted.