./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-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 60c415120e2678b24f3b884ebcebefc19905a98d476a557ead28c297441bd0dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:02:55,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:02:55,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:02:55,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:02:55,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:02:55,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:02:55,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:02:55,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:02:55,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:02:55,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:02:55,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:02:55,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:02:55,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:02:55,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:02:55,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:02:55,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:02:55,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:02:55,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:02:55,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:02:55,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:02:55,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:02:55,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:02:55,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:02:55,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:02:55,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:02:55,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:02:55,767 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 -> 60c415120e2678b24f3b884ebcebefc19905a98d476a557ead28c297441bd0dd [2025-03-03 15:02:56,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:02:56,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:02:56,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:02:56,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:02:56,044 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:02:56,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:02:57,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0321e564f/a0830e60a83044bbabbef09b54b6755d/FLAG1a30a2482 [2025-03-03 15:02:57,533 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:02:57,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:02:57,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0321e564f/a0830e60a83044bbabbef09b54b6755d/FLAG1a30a2482 [2025-03-03 15:02:57,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0321e564f/a0830e60a83044bbabbef09b54b6755d [2025-03-03 15:02:57,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:02:57,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:02:57,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:02:57,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:02:57,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:02:57,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:02:57" (1/1) ... [2025-03-03 15:02:57,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd3c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:57, skipping insertion in model container [2025-03-03 15:02:57,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:02:57" (1/1) ... [2025-03-03 15:02:57,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:02:58,039 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_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2025-03-03 15:02:58,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:02:58,103 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:02:58,174 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_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2025-03-03 15:02:58,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:02:58,225 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:02:58,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58 WrapperNode [2025-03-03 15:02:58,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:02:58,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:02:58,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:02:58,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:02:58,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,323 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1367 [2025-03-03 15:02:58,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:02:58,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:02:58,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:02:58,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:02:58,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,375 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:02:58,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:02:58,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:02:58,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:02:58,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:02:58,428 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (1/1) ... [2025-03-03 15:02:58,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:02:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:02:58,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:02:58,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:02:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:02:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:02:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:02:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:02:58,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:02:58,608 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:02:59,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1291: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:02:59,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:02:59,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1147: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:02:59,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:02:59,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-03 15:02:59,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:02:59,565 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-03 15:02:59,565 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:02:59,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:02:59,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:02:59,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:02:59 BoogieIcfgContainer [2025-03-03 15:02:59,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:02:59,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:02:59,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:02:59,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:02:59,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:02:57" (1/3) ... [2025-03-03 15:02:59,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6355e7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:02:59, skipping insertion in model container [2025-03-03 15:02:59,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:58" (2/3) ... [2025-03-03 15:02:59,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6355e7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:02:59, skipping insertion in model container [2025-03-03 15:02:59,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:02:59" (3/3) ... [2025-03-03 15:02:59,589 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:02:59,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:02:59,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 326 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:02:59,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:02:59,673 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;@21545eec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:02:59,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:02:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:02:59,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:59,689 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-03 15:02:59,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:59,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 356269290, now seen corresponding path program 1 times [2025-03-03 15:02:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899503266] [2025-03-03 15:02:59,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:59,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:02:59,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:02:59,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:59,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:00,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:00,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899503266] [2025-03-03 15:03:00,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899503266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:00,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:00,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683184084] [2025-03-03 15:03:00,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:00,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:00,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:00,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:00,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:00,253 INFO L87 Difference]: Start difference. First operand has 326 states, 324 states have (on average 1.7962962962962963) internal successors, (582), 325 states have internal predecessors, (582), 0 states have call successors, (0), 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 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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-03 15:03:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:00,366 INFO L93 Difference]: Finished difference Result 589 states and 1021 transitions. [2025-03-03 15:03:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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-03 15:03:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:00,378 INFO L225 Difference]: With dead ends: 589 [2025-03-03 15:03:00,378 INFO L226 Difference]: Without dead ends: 446 [2025-03-03 15:03:00,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:00,383 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 232 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:00,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1075 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-03 15:03:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2025-03-03 15:03:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.660633484162896) internal successors, (734), 442 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 734 transitions. [2025-03-03 15:03:00,445 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 734 transitions. Word has length 110 [2025-03-03 15:03:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:00,446 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 734 transitions. [2025-03-03 15:03:00,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 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-03 15:03:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 734 transitions. [2025-03-03 15:03:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:03:00,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:00,449 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-03 15:03:00,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:03:00,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:00,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1716620315, now seen corresponding path program 1 times [2025-03-03 15:03:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:00,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786384302] [2025-03-03 15:03:00,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:00,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:03:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:03:00,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:00,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786384302] [2025-03-03 15:03:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786384302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:00,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:00,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828520353] [2025-03-03 15:03:00,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:00,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:00,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:00,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:00,695 INFO L87 Difference]: Start difference. First operand 443 states and 734 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-03 15:03:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:00,739 INFO L93 Difference]: Finished difference Result 933 states and 1550 transitions. [2025-03-03 15:03:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:00,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-03 15:03:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:00,742 INFO L225 Difference]: With dead ends: 933 [2025-03-03 15:03:00,742 INFO L226 Difference]: Without dead ends: 679 [2025-03-03 15:03:00,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:00,743 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 200 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:00,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1028 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-03 15:03:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 675. [2025-03-03 15:03:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.6587537091988132) internal successors, (1118), 674 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1118 transitions. [2025-03-03 15:03:00,776 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1118 transitions. Word has length 113 [2025-03-03 15:03:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:00,777 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1118 transitions. [2025-03-03 15:03:00,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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-03 15:03:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1118 transitions. [2025-03-03 15:03:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:03:00,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:00,782 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-03 15:03:00,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:03:00,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:00,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1435353972, now seen corresponding path program 1 times [2025-03-03 15:03:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:00,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987748725] [2025-03-03 15:03:00,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:00,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:03:00,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:03:00,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:00,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987748725] [2025-03-03 15:03:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987748725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:00,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858256] [2025-03-03 15:03:00,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:00,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:00,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:00,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:00,997 INFO L87 Difference]: Start difference. First operand 675 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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-03 15:03:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:01,045 INFO L93 Difference]: Finished difference Result 1611 states and 2668 transitions. [2025-03-03 15:03:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:01,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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-03 15:03:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:01,050 INFO L225 Difference]: With dead ends: 1611 [2025-03-03 15:03:01,050 INFO L226 Difference]: Without dead ends: 1125 [2025-03-03 15:03:01,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:01,054 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 194 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:01,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1029 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-03 15:03:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1119. [2025-03-03 15:03:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1118 states have (on average 1.6511627906976745) internal successors, (1846), 1118 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1846 transitions. [2025-03-03 15:03:01,087 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1846 transitions. Word has length 116 [2025-03-03 15:03:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:01,088 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1846 transitions. [2025-03-03 15:03:01,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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-03 15:03:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1846 transitions. [2025-03-03 15:03:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 15:03:01,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:01,091 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-03 15:03:01,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:03:01,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:01,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1659227, now seen corresponding path program 1 times [2025-03-03 15:03:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:01,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965543434] [2025-03-03 15:03:01,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:01,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:03:01,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:03:01,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:01,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:01,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-03 15:03:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965543434] [2025-03-03 15:03:01,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965543434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:01,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:01,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7401223] [2025-03-03 15:03:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:01,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:01,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:01,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:01,278 INFO L87 Difference]: Start difference. First operand 1119 states and 1846 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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-03 15:03:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:01,322 INFO L93 Difference]: Finished difference Result 2907 states and 4784 transitions. [2025-03-03 15:03:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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-03 15:03:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:01,329 INFO L225 Difference]: With dead ends: 2907 [2025-03-03 15:03:01,330 INFO L226 Difference]: Without dead ends: 1977 [2025-03-03 15:03:01,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:01,334 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 188 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:01,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1030 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-03-03 15:03:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1967. [2025-03-03 15:03:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 1.6388606307222788) internal successors, (3222), 1966 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3222 transitions. [2025-03-03 15:03:01,379 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3222 transitions. Word has length 119 [2025-03-03 15:03:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:01,379 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3222 transitions. [2025-03-03 15:03:01,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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-03 15:03:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3222 transitions. [2025-03-03 15:03:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 15:03:01,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:01,382 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-03 15:03:01,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:03:01,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:01,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1645144574, now seen corresponding path program 1 times [2025-03-03 15:03:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:01,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648316025] [2025-03-03 15:03:01,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:01,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 15:03:01,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 15:03:01,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:01,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:01,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648316025] [2025-03-03 15:03:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648316025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:01,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:01,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:03:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146492838] [2025-03-03 15:03:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:01,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:03:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:01,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:03:01,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:03:01,582 INFO L87 Difference]: Start difference. First operand 1967 states and 3222 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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-03 15:03:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:01,884 INFO L93 Difference]: Finished difference Result 10223 states and 16898 transitions. [2025-03-03 15:03:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:03:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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-03 15:03:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:01,910 INFO L225 Difference]: With dead ends: 10223 [2025-03-03 15:03:01,910 INFO L226 Difference]: Without dead ends: 8445 [2025-03-03 15:03:01,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:03:01,916 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 1767 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:01,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 5082 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:03:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2025-03-03 15:03:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 3625. [2025-03-03 15:03:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 3624 states have (on average 1.6382450331125828) internal successors, (5937), 3624 states have internal predecessors, (5937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5937 transitions. [2025-03-03 15:03:02,021 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5937 transitions. Word has length 122 [2025-03-03 15:03:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:02,021 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5937 transitions. [2025-03-03 15:03:02,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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-03 15:03:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5937 transitions. [2025-03-03 15:03:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:03:02,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:02,024 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-03 15:03:02,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:03:02,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:02,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash -538157562, now seen corresponding path program 1 times [2025-03-03 15:03:02,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:02,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239524064] [2025-03-03 15:03:02,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:02,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:03:02,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:03:02,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:02,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239524064] [2025-03-03 15:03:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239524064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:02,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:02,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839793947] [2025-03-03 15:03:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:02,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:02,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:02,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:02,165 INFO L87 Difference]: Start difference. First operand 3625 states and 5937 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 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-03 15:03:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:02,262 INFO L93 Difference]: Finished difference Result 10605 states and 17475 transitions. [2025-03-03 15:03:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 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-03 15:03:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:02,312 INFO L225 Difference]: With dead ends: 10605 [2025-03-03 15:03:02,312 INFO L226 Difference]: Without dead ends: 7169 [2025-03-03 15:03:02,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:03:02,315 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 656 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:02,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1614 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2025-03-03 15:03:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 5380. [2025-03-03 15:03:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5380 states, 5379 states have (on average 1.6417549730433165) internal successors, (8831), 5379 states have internal predecessors, (8831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5380 states to 5380 states and 8831 transitions. [2025-03-03 15:03:02,414 INFO L78 Accepts]: Start accepts. Automaton has 5380 states and 8831 transitions. Word has length 123 [2025-03-03 15:03:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 5380 states and 8831 transitions. [2025-03-03 15:03:02,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 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-03 15:03:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5380 states and 8831 transitions. [2025-03-03 15:03:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:03:02,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:02,417 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-03 15:03:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:03:02,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 498863585, now seen corresponding path program 1 times [2025-03-03 15:03:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127229133] [2025-03-03 15:03:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:02,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 15:03:02,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 15:03:02,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:02,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127229133] [2025-03-03 15:03:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127229133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:02,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:02,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283167138] [2025-03-03 15:03:02,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:02,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:02,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:02,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:02,541 INFO L87 Difference]: Start difference. First operand 5380 states and 8831 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-03 15:03:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:02,679 INFO L93 Difference]: Finished difference Result 15777 states and 25981 transitions. [2025-03-03 15:03:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:02,679 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-03 15:03:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:02,750 INFO L225 Difference]: With dead ends: 15777 [2025-03-03 15:03:02,750 INFO L226 Difference]: Without dead ends: 10586 [2025-03-03 15:03:02,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:03:02,755 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 656 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:02,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1762 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10586 states. [2025-03-03 15:03:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10586 to 7959. [2025-03-03 15:03:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7959 states, 7958 states have (on average 1.6406132194018597) internal successors, (13056), 7958 states have internal predecessors, (13056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7959 states to 7959 states and 13056 transitions. [2025-03-03 15:03:02,949 INFO L78 Accepts]: Start accepts. Automaton has 7959 states and 13056 transitions. Word has length 124 [2025-03-03 15:03:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:02,949 INFO L471 AbstractCegarLoop]: Abstraction has 7959 states and 13056 transitions. [2025-03-03 15:03:02,949 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-03 15:03:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7959 states and 13056 transitions. [2025-03-03 15:03:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:03:02,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:02,953 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, 1] [2025-03-03 15:03:02,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:03:02,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:02,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash -141012857, now seen corresponding path program 1 times [2025-03-03 15:03:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:02,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717582906] [2025-03-03 15:03:02,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:02,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:03:02,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:03:02,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:02,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:03,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717582906] [2025-03-03 15:03:03,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717582906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:03,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:03,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827395745] [2025-03-03 15:03:03,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:03,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:03,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:03,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:03,043 INFO L87 Difference]: Start difference. First operand 7959 states and 13056 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:03,113 INFO L93 Difference]: Finished difference Result 17589 states and 29027 transitions. [2025-03-03 15:03:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:03,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:03:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:03,134 INFO L225 Difference]: With dead ends: 17589 [2025-03-03 15:03:03,135 INFO L226 Difference]: Without dead ends: 12141 [2025-03-03 15:03:03,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:03,146 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 205 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:03,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12141 states. [2025-03-03 15:03:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12141 to 12139. [2025-03-03 15:03:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12139 states, 12138 states have (on average 1.6423628274839348) internal successors, (19935), 12138 states have internal predecessors, (19935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12139 states to 12139 states and 19935 transitions. [2025-03-03 15:03:03,373 INFO L78 Accepts]: Start accepts. Automaton has 12139 states and 19935 transitions. Word has length 125 [2025-03-03 15:03:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:03,373 INFO L471 AbstractCegarLoop]: Abstraction has 12139 states and 19935 transitions. [2025-03-03 15:03:03,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 12139 states and 19935 transitions. [2025-03-03 15:03:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:03:03,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:03,375 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, 1] [2025-03-03 15:03:03,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:03:03,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:03,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2006145627, now seen corresponding path program 1 times [2025-03-03 15:03:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:03,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74784486] [2025-03-03 15:03:03,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:03,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:03:03,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:03:03,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:03,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74784486] [2025-03-03 15:03:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74784486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:03,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643034499] [2025-03-03 15:03:03,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:03,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:03,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:03,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:03,462 INFO L87 Difference]: Start difference. First operand 12139 states and 19935 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:03,531 INFO L93 Difference]: Finished difference Result 26635 states and 43863 transitions. [2025-03-03 15:03:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:03,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:03:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:03,565 INFO L225 Difference]: With dead ends: 26635 [2025-03-03 15:03:03,566 INFO L226 Difference]: Without dead ends: 18336 [2025-03-03 15:03:03,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:03,586 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 199 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:03,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18336 states. [2025-03-03 15:03:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18336 to 18334. [2025-03-03 15:03:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18334 states, 18333 states have (on average 1.639720722194949) internal successors, (30061), 18333 states have internal predecessors, (30061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18334 states to 18334 states and 30061 transitions. [2025-03-03 15:03:03,866 INFO L78 Accepts]: Start accepts. Automaton has 18334 states and 30061 transitions. Word has length 125 [2025-03-03 15:03:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:03,867 INFO L471 AbstractCegarLoop]: Abstraction has 18334 states and 30061 transitions. [2025-03-03 15:03:03,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 18334 states and 30061 transitions. [2025-03-03 15:03:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:03:03,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:03,868 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, 1] [2025-03-03 15:03:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:03:03,868 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -954984783, now seen corresponding path program 1 times [2025-03-03 15:03:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139064811] [2025-03-03 15:03:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:03,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:03:03,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:03:03,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:03,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139064811] [2025-03-03 15:03:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139064811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:03,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:03,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083480049] [2025-03-03 15:03:03,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:03,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:03,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:03,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:03,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:03,961 INFO L87 Difference]: Start difference. First operand 18334 states and 30061 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:04,153 INFO L93 Difference]: Finished difference Result 35437 states and 58312 transitions. [2025-03-03 15:03:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:04,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:03:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:04,198 INFO L225 Difference]: With dead ends: 35437 [2025-03-03 15:03:04,198 INFO L226 Difference]: Without dead ends: 25494 [2025-03-03 15:03:04,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:04,211 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 193 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:04,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25494 states. [2025-03-03 15:03:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25494 to 25492. [2025-03-03 15:03:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25492 states, 25491 states have (on average 1.637754501588796) internal successors, (41748), 25491 states have internal predecessors, (41748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25492 states to 25492 states and 41748 transitions. [2025-03-03 15:03:04,612 INFO L78 Accepts]: Start accepts. Automaton has 25492 states and 41748 transitions. Word has length 125 [2025-03-03 15:03:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 25492 states and 41748 transitions. [2025-03-03 15:03:04,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 25492 states and 41748 transitions. [2025-03-03 15:03:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:03:04,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:04,614 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, 1] [2025-03-03 15:03:04,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:03:04,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:04,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 60181383, now seen corresponding path program 1 times [2025-03-03 15:03:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370545558] [2025-03-03 15:03:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:04,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:03:04,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:03:04,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:04,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:04,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:04,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370545558] [2025-03-03 15:03:04,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370545558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:04,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:04,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:04,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288100247] [2025-03-03 15:03:04,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:04,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:04,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:04,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:04,723 INFO L87 Difference]: Start difference. First operand 25492 states and 41748 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:04,881 INFO L93 Difference]: Finished difference Result 48835 states and 80309 transitions. [2025-03-03 15:03:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:04,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:03:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:04,954 INFO L225 Difference]: With dead ends: 48835 [2025-03-03 15:03:04,955 INFO L226 Difference]: Without dead ends: 35072 [2025-03-03 15:03:04,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:04,983 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 187 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:04,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35072 states. [2025-03-03 15:03:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35072 to 35070. [2025-03-03 15:03:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35070 states, 35069 states have (on average 1.635775186061764) internal successors, (57365), 35069 states have internal predecessors, (57365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35070 states to 35070 states and 57365 transitions. [2025-03-03 15:03:05,578 INFO L78 Accepts]: Start accepts. Automaton has 35070 states and 57365 transitions. Word has length 125 [2025-03-03 15:03:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:05,579 INFO L471 AbstractCegarLoop]: Abstraction has 35070 states and 57365 transitions. [2025-03-03 15:03:05,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 35070 states and 57365 transitions. [2025-03-03 15:03:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:03:05,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:05,580 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, 1] [2025-03-03 15:03:05,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:03:05,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:05,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1713308599, now seen corresponding path program 1 times [2025-03-03 15:03:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:05,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609202469] [2025-03-03 15:03:05,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:05,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:03:05,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:03:05,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:05,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:05,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609202469] [2025-03-03 15:03:05,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609202469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:05,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969946670] [2025-03-03 15:03:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:05,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:05,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:05,704 INFO L87 Difference]: Start difference. First operand 35070 states and 57365 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:06,144 INFO L93 Difference]: Finished difference Result 113660 states and 186457 transitions. [2025-03-03 15:03:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:03:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:06,321 INFO L225 Difference]: With dead ends: 113660 [2025-03-03 15:03:06,321 INFO L226 Difference]: Without dead ends: 78834 [2025-03-03 15:03:06,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:03:06,360 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 654 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:06,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1700 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78834 states. [2025-03-03 15:03:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78834 to 56809. [2025-03-03 15:03:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56809 states, 56808 states have (on average 1.63212927756654) internal successors, (92718), 56808 states have internal predecessors, (92718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56809 states to 56809 states and 92718 transitions. [2025-03-03 15:03:07,332 INFO L78 Accepts]: Start accepts. Automaton has 56809 states and 92718 transitions. Word has length 125 [2025-03-03 15:03:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:07,333 INFO L471 AbstractCegarLoop]: Abstraction has 56809 states and 92718 transitions. [2025-03-03 15:03:07,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 56809 states and 92718 transitions. [2025-03-03 15:03:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 15:03:07,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:07,336 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, 1, 1] [2025-03-03 15:03:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:03:07,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1571258940, now seen corresponding path program 1 times [2025-03-03 15:03:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484977539] [2025-03-03 15:03:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:07,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 15:03:07,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 15:03:07,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:07,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:07,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484977539] [2025-03-03 15:03:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484977539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:07,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30715958] [2025-03-03 15:03:07,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:07,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:07,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:07,482 INFO L87 Difference]: Start difference. First operand 56809 states and 92718 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:08,161 INFO L93 Difference]: Finished difference Result 182062 states and 297983 transitions. [2025-03-03 15:03:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-03 15:03:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:08,412 INFO L225 Difference]: With dead ends: 182062 [2025-03-03 15:03:08,412 INFO L226 Difference]: Without dead ends: 125497 [2025-03-03 15:03:08,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:03:08,460 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 652 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:08,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1766 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125497 states. [2025-03-03 15:03:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125497 to 90928. [2025-03-03 15:03:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6284601933419116) internal successors, (148071), 90927 states have internal predecessors, (148071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 148071 transitions. [2025-03-03 15:03:09,919 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 148071 transitions. Word has length 126 [2025-03-03 15:03:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:09,919 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 148071 transitions. [2025-03-03 15:03:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 148071 transitions. [2025-03-03 15:03:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 15:03:09,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:09,928 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, 1, 1, 1, 1] [2025-03-03 15:03:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:03:09,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:09,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1900129798, now seen corresponding path program 1 times [2025-03-03 15:03:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435701649] [2025-03-03 15:03:09,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:09,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 15:03:10,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 15:03:10,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435701649] [2025-03-03 15:03:10,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435701649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:10,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:10,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:03:10,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884577647] [2025-03-03 15:03:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:10,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:03:10,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:10,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:03:10,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:03:10,464 INFO L87 Difference]: Start difference. First operand 90928 states and 148071 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:11,373 INFO L93 Difference]: Finished difference Result 181614 states and 295752 transitions. [2025-03-03 15:03:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:03:11,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-03 15:03:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:11,502 INFO L225 Difference]: With dead ends: 181614 [2025-03-03 15:03:11,503 INFO L226 Difference]: Without dead ends: 90930 [2025-03-03 15:03:11,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:03:11,590 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 192 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:11,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 2544 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:03:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90930 states. [2025-03-03 15:03:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90930 to 90928. [2025-03-03 15:03:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90928 states, 90927 states have (on average 1.6215865474501523) internal successors, (147446), 90927 states have internal predecessors, (147446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90928 states to 90928 states and 147446 transitions. [2025-03-03 15:03:12,592 INFO L78 Accepts]: Start accepts. Automaton has 90928 states and 147446 transitions. Word has length 128 [2025-03-03 15:03:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:12,592 INFO L471 AbstractCegarLoop]: Abstraction has 90928 states and 147446 transitions. [2025-03-03 15:03:12,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 90928 states and 147446 transitions. [2025-03-03 15:03:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:03:12,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:12,593 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:12,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:03:12,594 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:12,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash 485376627, now seen corresponding path program 1 times [2025-03-03 15:03:12,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:12,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434222943] [2025-03-03 15:03:12,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:12,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:03:12,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:03:12,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434222943] [2025-03-03 15:03:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434222943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:03:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359618207] [2025-03-03 15:03:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:03:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:12,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:03:12,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:03:12,853 INFO L87 Difference]: Start difference. First operand 90928 states and 147446 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:13,938 INFO L93 Difference]: Finished difference Result 265772 states and 431468 transitions. [2025-03-03 15:03:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:03:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-03 15:03:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:14,170 INFO L225 Difference]: With dead ends: 265772 [2025-03-03 15:03:14,171 INFO L226 Difference]: Without dead ends: 175088 [2025-03-03 15:03:14,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:03:14,225 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 190 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:14,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2561 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:03:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175088 states. [2025-03-03 15:03:15,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175088 to 175086. [2025-03-03 15:03:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175086 states, 175085 states have (on average 1.6129023045949111) internal successors, (282395), 175085 states have internal predecessors, (282395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175086 states to 175086 states and 282395 transitions. [2025-03-03 15:03:16,561 INFO L78 Accepts]: Start accepts. Automaton has 175086 states and 282395 transitions. Word has length 131 [2025-03-03 15:03:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:16,561 INFO L471 AbstractCegarLoop]: Abstraction has 175086 states and 282395 transitions. [2025-03-03 15:03:16,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 175086 states and 282395 transitions. [2025-03-03 15:03:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 15:03:16,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:16,562 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:16,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:03:16,562 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2132238445, now seen corresponding path program 1 times [2025-03-03 15:03:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883137389] [2025-03-03 15:03:16,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:16,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 15:03:16,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 15:03:16,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:16,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:16,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883137389] [2025-03-03 15:03:16,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883137389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:16,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:16,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:03:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253651911] [2025-03-03 15:03:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:16,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:03:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:16,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:03:16,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:03:16,980 INFO L87 Difference]: Start difference. First operand 175086 states and 282395 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:17,625 INFO L93 Difference]: Finished difference Result 178960 states and 288204 transitions. [2025-03-03 15:03:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:03:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-03 15:03:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:17,907 INFO L225 Difference]: With dead ends: 178960 [2025-03-03 15:03:17,907 INFO L226 Difference]: Without dead ends: 178958 [2025-03-03 15:03:17,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:03:17,973 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:17,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2115 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178958 states. [2025-03-03 15:03:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178958 to 178958. [2025-03-03 15:03:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178958 states, 178957 states have (on average 1.5994903803707037) internal successors, (286240), 178957 states have internal predecessors, (286240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178958 states to 178958 states and 286240 transitions. [2025-03-03 15:03:20,365 INFO L78 Accepts]: Start accepts. Automaton has 178958 states and 286240 transitions. Word has length 132 [2025-03-03 15:03:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:20,366 INFO L471 AbstractCegarLoop]: Abstraction has 178958 states and 286240 transitions. [2025-03-03 15:03:20,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 178958 states and 286240 transitions. [2025-03-03 15:03:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:03:20,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:20,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:20,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:03:20,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:20,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -829471034, now seen corresponding path program 1 times [2025-03-03 15:03:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332766754] [2025-03-03 15:03:20,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:20,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:03:20,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:03:20,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:20,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 15:03:20,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:20,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332766754] [2025-03-03 15:03:20,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332766754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:20,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:20,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:20,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623255375] [2025-03-03 15:03:20,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:20,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:20,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:20,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:20,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:20,482 INFO L87 Difference]: Start difference. First operand 178958 states and 286240 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:21,894 INFO L93 Difference]: Finished difference Result 404821 states and 650314 transitions. [2025-03-03 15:03:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-03 15:03:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:22,492 INFO L225 Difference]: With dead ends: 404821 [2025-03-03 15:03:22,492 INFO L226 Difference]: Without dead ends: 325019 [2025-03-03 15:03:22,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:22,629 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 178 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:22,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1018 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325019 states. [2025-03-03 15:03:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325019 to 324767. [2025-03-03 15:03:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324767 states, 324766 states have (on average 1.6031912207558674) internal successors, (520662), 324766 states have internal predecessors, (520662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324767 states to 324767 states and 520662 transitions. [2025-03-03 15:03:26,927 INFO L78 Accepts]: Start accepts. Automaton has 324767 states and 520662 transitions. Word has length 163 [2025-03-03 15:03:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:26,927 INFO L471 AbstractCegarLoop]: Abstraction has 324767 states and 520662 transitions. [2025-03-03 15:03:26,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 324767 states and 520662 transitions. [2025-03-03 15:03:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:03:26,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:26,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:26,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:03:26,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1317687450, now seen corresponding path program 1 times [2025-03-03 15:03:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846133301] [2025-03-03 15:03:26,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:26,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:03:26,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:03:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:03:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846133301] [2025-03-03 15:03:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846133301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:27,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:27,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:03:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013966595] [2025-03-03 15:03:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:27,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:03:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:27,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:03:27,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:03:27,672 INFO L87 Difference]: Start difference. First operand 324767 states and 520662 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:30,789 INFO L93 Difference]: Finished difference Result 894588 states and 1439036 transitions. [2025-03-03 15:03:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:03:30,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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 163 [2025-03-03 15:03:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:32,186 INFO L225 Difference]: With dead ends: 894588 [2025-03-03 15:03:32,186 INFO L226 Difference]: Without dead ends: 752876 [2025-03-03 15:03:32,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:03:32,379 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1313 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:32,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 2905 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752876 states. [2025-03-03 15:03:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752876 to 524128. [2025-03-03 15:03:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524128 states, 524127 states have (on average 1.6016366262375341) internal successors, (839461), 524127 states have internal predecessors, (839461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524128 states to 524128 states and 839461 transitions. [2025-03-03 15:03:41,059 INFO L78 Accepts]: Start accepts. Automaton has 524128 states and 839461 transitions. Word has length 163 [2025-03-03 15:03:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:41,060 INFO L471 AbstractCegarLoop]: Abstraction has 524128 states and 839461 transitions. [2025-03-03 15:03:41,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 524128 states and 839461 transitions. [2025-03-03 15:03:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:03:41,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:41,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:41,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:03:41,065 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:41,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1643442960, now seen corresponding path program 1 times [2025-03-03 15:03:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:41,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261814807] [2025-03-03 15:03:41,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:41,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:03:41,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:03:41,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:41,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat