./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
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_opt-floodmax.4.2.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 a0830d37f242e09defcc4d2d6beb9093926cd5edb365bec0ac48d44d51893439
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 19:39:51,019 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 19:39:51,072 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 19:39:51,076 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 19:39:51,076 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 19:39:51,101 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 19:39:51,103 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 19:39:51,103 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 19:39:51,103 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 19:39:51,103 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 19:39:51,104 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 19:39:51,104 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 19:39:51,104 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 19:39:51,104 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 19:39:51,105 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 19:39:51,105 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 19:39:51,106 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 19:39:51,106 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 19:39:51,106 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 19:39:51,106 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 -> a0830d37f242e09defcc4d2d6beb9093926cd5edb365bec0ac48d44d51893439
[2025-03-16 19:39:51,358 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 19:39:51,364 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 19:39:51,366 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 19:39:51,367 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 19:39:51,367 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 19:39:51,368 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:52,567 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a63e53b/a2564d1bc9f449ff9429ad45c057fa4a/FLAG93b875f6d
[2025-03-16 19:39:52,861 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 19:39:52,865 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:52,876 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a63e53b/a2564d1bc9f449ff9429ad45c057fa4a/FLAG93b875f6d
[2025-03-16 19:39:53,154 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a63e53b/a2564d1bc9f449ff9429ad45c057fa4a
[2025-03-16 19:39:53,155 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 19:39:53,156 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 19:39:53,157 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 19:39:53,157 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 19:39:53,160 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 19:39:53,161 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,161 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c3afc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53, skipping insertion in model container
[2025-03-16 19:39:53,162 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,197 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 19:39:53,381 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_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839]
[2025-03-16 19:39:53,427 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 19:39:53,444 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 19:39:53,503 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_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839]
[2025-03-16 19:39:53,531 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 19:39:53,550 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 19:39:53,552 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53 WrapperNode
[2025-03-16 19:39:53,552 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 19:39:53,553 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 19:39:53,553 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 19:39:53,553 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 19:39:53,558 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,572 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,615 INFO  L138                Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1451
[2025-03-16 19:39:53,615 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 19:39:53,616 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 19:39:53,616 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 19:39:53,616 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 19:39:53,623 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,623 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,634 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,666 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-16 19:39:53,666 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,666 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,694 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,697 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,706 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,712 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,718 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 19:39:53,719 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 19:39:53,719 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 19:39:53,719 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 19:39:53,720 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (1/1) ...
[2025-03-16 19:39:53,724 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 19:39:53,735 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 19:39:53,749 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-16 19:39:53,751 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-16 19:39:53,769 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 19:39:53,770 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 19:39:53,770 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 19:39:53,770 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 19:39:53,879 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 19:39:53,881 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 19:39:54,889 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1400: 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-16 19:39:54,890 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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-16 19:39:54,890 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1070: 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-16 19:39:54,890 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L905: 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-16 19:39:54,890 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_~node3__newmax~0#1;
[2025-03-16 19:39:54,890 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__newmax~0#1;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-16 19:39:54,890 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc main_~node4__newmax~0#1;
[2025-03-16 19:39:54,891 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L726: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;
[2025-03-16 19:39:54,891 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_~node2__newmax~0#1;
[2025-03-16 19:39:54,976 INFO  L?                        ?]: Removed 123 outVars from TransFormulas that were not future-live.
[2025-03-16 19:39:54,976 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 19:39:54,994 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 19:39:54,995 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 19:39:54,995 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:54 BoogieIcfgContainer
[2025-03-16 19:39:54,995 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 19:39:54,998 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 19:39:54,998 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 19:39:55,001 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 19:39:55,001 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:39:53" (1/3) ...
[2025-03-16 19:39:55,002 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408baf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:55, skipping insertion in model container
[2025-03-16 19:39:55,003 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:53" (2/3) ...
[2025-03-16 19:39:55,003 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408baf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:55, skipping insertion in model container
[2025-03-16 19:39:55,003 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:54" (3/3) ...
[2025-03-16 19:39:55,005 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:55,017 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 19:39:55,020 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 349 locations, 1 initial locations, 0 loop locations, and 1 error locations.
[2025-03-16 19:39:55,076 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 19:39:55,086 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;@34958fe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 19:39:55,086 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 19:39:55,092 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 349 states, 347 states have (on average 1.7896253602305476) internal successors, (621), 348 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:55,105 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-16 19:39:55,105 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:55,106 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:55,107 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:55,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:55,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -732847651, now seen corresponding path program 1 times
[2025-03-16 19:39:55,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:55,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267944419]
[2025-03-16 19:39:55,116 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:55,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:55,201 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-16 19:39:55,359 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-16 19:39:55,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:55,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:55,666 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-16 19:39:55,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:55,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267944419]
[2025-03-16 19:39:55,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267944419] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:55,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:55,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:55,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692875004]
[2025-03-16 19:39:55,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:55,674 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:55,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:55,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:55,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:55,691 INFO  L87              Difference]: Start difference. First operand  has 349 states, 347 states have (on average 1.7896253602305476) internal successors, (621), 348 states have internal predecessors, (621), 0 states have call successors, (0), 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 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:55,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:55,783 INFO  L93              Difference]: Finished difference Result 651 states and 1123 transitions.
[2025-03-16 19:39:55,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:55,785 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117
[2025-03-16 19:39:55,786 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:55,793 INFO  L225             Difference]: With dead ends: 651
[2025-03-16 19:39:55,793 INFO  L226             Difference]: Without dead ends: 488
[2025-03-16 19:39:55,795 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-16 19:39:55,797 INFO  L435           NwaCegarLoop]: 615 mSDtfsCounter, 266 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:55,798 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1145 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:55,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 488 states.
[2025-03-16 19:39:55,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 485.
[2025-03-16 19:39:55,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 485 states, 484 states have (on average 1.6528925619834711) internal successors, (800), 484 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:55,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 800 transitions.
[2025-03-16 19:39:55,873 INFO  L78                 Accepts]: Start accepts. Automaton has 485 states and 800 transitions. Word has length 117
[2025-03-16 19:39:55,873 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:55,873 INFO  L471      AbstractCegarLoop]: Abstraction has 485 states and 800 transitions.
[2025-03-16 19:39:55,874 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:55,874 INFO  L276                IsEmpty]: Start isEmpty. Operand 485 states and 800 transitions.
[2025-03-16 19:39:55,876 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-03-16 19:39:55,876 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:55,876 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:55,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 19:39:55,876 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:55,880 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:55,880 INFO  L85        PathProgramCache]: Analyzing trace with hash -542678618, now seen corresponding path program 1 times
[2025-03-16 19:39:55,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:55,880 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420165213]
[2025-03-16 19:39:55,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:55,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:55,905 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-03-16 19:39:55,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-03-16 19:39:55,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:55,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:56,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:56,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:56,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420165213]
[2025-03-16 19:39:56,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420165213] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:56,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:56,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:56,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596147457]
[2025-03-16 19:39:56,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:56,130 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:56,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:56,130 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:56,131 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:56,131 INFO  L87              Difference]: Start difference. First operand 485 states and 800 transitions. Second operand  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:56,178 INFO  L93              Difference]: Finished difference Result 1051 states and 1740 transitions.
[2025-03-16 19:39:56,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:56,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120
[2025-03-16 19:39:56,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:56,184 INFO  L225             Difference]: With dead ends: 1051
[2025-03-16 19:39:56,184 INFO  L226             Difference]: Without dead ends: 758
[2025-03-16 19:39:56,189 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-16 19:39:56,189 INFO  L435           NwaCegarLoop]: 568 mSDtfsCounter, 229 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:56,190 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1095 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:56,191 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 758 states.
[2025-03-16 19:39:56,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754.
[2025-03-16 19:39:56,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 754 states, 753 states have (on average 1.653386454183267) internal successors, (1245), 753 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1245 transitions.
[2025-03-16 19:39:56,223 INFO  L78                 Accepts]: Start accepts. Automaton has 754 states and 1245 transitions. Word has length 120
[2025-03-16 19:39:56,223 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:56,223 INFO  L471      AbstractCegarLoop]: Abstraction has 754 states and 1245 transitions.
[2025-03-16 19:39:56,223 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,223 INFO  L276                IsEmpty]: Start isEmpty. Operand 754 states and 1245 transitions.
[2025-03-16 19:39:56,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-16 19:39:56,226 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:56,226 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-16 19:39:56,226 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 19:39:56,226 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:56,226 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:56,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 754764722, now seen corresponding path program 1 times
[2025-03-16 19:39:56,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:56,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694415039]
[2025-03-16 19:39:56,227 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:56,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:56,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-16 19:39:56,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-16 19:39:56,273 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:56,273 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:56,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:56,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:56,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694415039]
[2025-03-16 19:39:56,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694415039] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:56,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:56,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:56,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080130627]
[2025-03-16 19:39:56,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:56,426 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:56,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:56,427 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:56,427 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:56,427 INFO  L87              Difference]: Start difference. First operand 754 states and 1245 transitions. Second operand  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:56,469 INFO  L93              Difference]: Finished difference Result 1838 states and 3039 transitions.
[2025-03-16 19:39:56,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:56,470 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123
[2025-03-16 19:39:56,470 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:56,475 INFO  L225             Difference]: With dead ends: 1838
[2025-03-16 19:39:56,475 INFO  L226             Difference]: Without dead ends: 1276
[2025-03-16 19:39:56,478 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-16 19:39:56,479 INFO  L435           NwaCegarLoop]: 568 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:56,480 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1096 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:56,482 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1276 states.
[2025-03-16 19:39:56,503 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1270.
[2025-03-16 19:39:56,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1270 states, 1269 states have (on average 1.649330181245075) internal successors, (2093), 1269 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2093 transitions.
[2025-03-16 19:39:56,509 INFO  L78                 Accepts]: Start accepts. Automaton has 1270 states and 2093 transitions. Word has length 123
[2025-03-16 19:39:56,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:56,510 INFO  L471      AbstractCegarLoop]: Abstraction has 1270 states and 2093 transitions.
[2025-03-16 19:39:56,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 1270 states and 2093 transitions.
[2025-03-16 19:39:56,512 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-16 19:39:56,513 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:56,513 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-16 19:39:56,513 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 19:39:56,514 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:56,514 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:56,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -1097710821, now seen corresponding path program 1 times
[2025-03-16 19:39:56,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:56,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278143605]
[2025-03-16 19:39:56,517 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:56,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:56,545 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-16 19:39:56,598 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-16 19:39:56,598 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:56,599 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:56,725 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-16 19:39:56,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:56,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278143605]
[2025-03-16 19:39:56,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278143605] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:56,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:56,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:56,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776087302]
[2025-03-16 19:39:56,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:56,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:56,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:56,728 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:56,728 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:56,728 INFO  L87              Difference]: Start difference. First operand 1270 states and 2093 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 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-16 19:39:56,772 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:56,772 INFO  L93              Difference]: Finished difference Result 3346 states and 5511 transitions.
[2025-03-16 19:39:56,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:56,774 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 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-16 19:39:56,774 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:56,782 INFO  L225             Difference]: With dead ends: 3346
[2025-03-16 19:39:56,782 INFO  L226             Difference]: Without dead ends: 2268
[2025-03-16 19:39:56,786 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-16 19:39:56,787 INFO  L435           NwaCegarLoop]: 568 mSDtfsCounter, 215 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:56,789 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1097 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:56,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2268 states.
[2025-03-16 19:39:56,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2258.
[2025-03-16 19:39:56,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2258 states, 2257 states have (on average 1.6415595923792645) internal successors, (3705), 2257 states have internal predecessors, (3705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3705 transitions.
[2025-03-16 19:39:56,837 INFO  L78                 Accepts]: Start accepts. Automaton has 2258 states and 3705 transitions. Word has length 126
[2025-03-16 19:39:56,838 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:56,838 INFO  L471      AbstractCegarLoop]: Abstraction has 2258 states and 3705 transitions.
[2025-03-16 19:39:56,838 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 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-16 19:39:56,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 2258 states and 3705 transitions.
[2025-03-16 19:39:56,840 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-03-16 19:39:56,840 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:56,841 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]
[2025-03-16 19:39:56,841 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 19:39:56,841 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:56,841 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:56,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -1051093369, now seen corresponding path program 1 times
[2025-03-16 19:39:56,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:56,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009881654]
[2025-03-16 19:39:56,842 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:56,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:56,868 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-03-16 19:39:56,890 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-03-16 19:39:56,890 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:56,890 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:57,072 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-16 19:39:57,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:57,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009881654]
[2025-03-16 19:39:57,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009881654] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:57,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:57,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:57,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599383643]
[2025-03-16 19:39:57,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:57,074 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:57,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:57,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:57,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:57,075 INFO  L87              Difference]: Start difference. First operand 2258 states and 3705 transitions. Second operand  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:57,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:57,394 INFO  L93              Difference]: Finished difference Result 11838 states and 19569 transitions.
[2025-03-16 19:39:57,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-16 19:39:57,395 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 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 129
[2025-03-16 19:39:57,395 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:57,430 INFO  L225             Difference]: With dead ends: 11838
[2025-03-16 19:39:57,430 INFO  L226             Difference]: Without dead ends: 9772
[2025-03-16 19:39:57,439 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-16 19:39:57,441 INFO  L435           NwaCegarLoop]: 577 mSDtfsCounter, 2227 mSDsluCounter, 4864 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:57,441 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 5441 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 19:39:57,452 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9772 states.
[2025-03-16 19:39:57,570 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9772 to 4188.
[2025-03-16 19:39:57,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4188 states, 4187 states have (on average 1.6412705994745642) internal successors, (6872), 4187 states have internal predecessors, (6872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:57,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 6872 transitions.
[2025-03-16 19:39:57,593 INFO  L78                 Accepts]: Start accepts. Automaton has 4188 states and 6872 transitions. Word has length 129
[2025-03-16 19:39:57,593 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:57,593 INFO  L471      AbstractCegarLoop]: Abstraction has 4188 states and 6872 transitions.
[2025-03-16 19:39:57,593 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:57,593 INFO  L276                IsEmpty]: Start isEmpty. Operand 4188 states and 6872 transitions.
[2025-03-16 19:39:57,595 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-03-16 19:39:57,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:57,596 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]
[2025-03-16 19:39:57,596 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 19:39:57,596 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:57,598 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:57,599 INFO  L85        PathProgramCache]: Analyzing trace with hash 1777812129, now seen corresponding path program 1 times
[2025-03-16 19:39:57,599 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:57,599 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136719741]
[2025-03-16 19:39:57,599 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:57,599 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:57,620 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-03-16 19:39:57,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-03-16 19:39:57,650 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:57,650 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:57,786 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-16 19:39:57,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:57,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136719741]
[2025-03-16 19:39:57,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136719741] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:57,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:57,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:57,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466153953]
[2025-03-16 19:39:57,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:57,787 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:57,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:57,787 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:57,787 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:57,788 INFO  L87              Difference]: Start difference. First operand 4188 states and 6872 transitions. Second operand  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:57,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:57,893 INFO  L93              Difference]: Finished difference Result 12286 states and 20260 transitions.
[2025-03-16 19:39:57,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:57,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130
[2025-03-16 19:39:57,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:57,919 INFO  L225             Difference]: With dead ends: 12286
[2025-03-16 19:39:57,920 INFO  L226             Difference]: Without dead ends: 8290
[2025-03-16 19:39:57,928 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:57,929 INFO  L435           NwaCegarLoop]: 572 mSDtfsCounter, 752 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:57,929 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1903 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:57,936 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8290 states.
[2025-03-16 19:39:58,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 6222.
[2025-03-16 19:39:58,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6222 states, 6221 states have (on average 1.6436264266195146) internal successors, (10225), 6221 states have internal predecessors, (10225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:58,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 10225 transitions.
[2025-03-16 19:39:58,064 INFO  L78                 Accepts]: Start accepts. Automaton has 6222 states and 10225 transitions. Word has length 130
[2025-03-16 19:39:58,064 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:58,064 INFO  L471      AbstractCegarLoop]: Abstraction has 6222 states and 10225 transitions.
[2025-03-16 19:39:58,064 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:58,064 INFO  L276                IsEmpty]: Start isEmpty. Operand 6222 states and 10225 transitions.
[2025-03-16 19:39:58,067 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-16 19:39:58,067 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:58,067 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-16 19:39:58,067 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 19:39:58,067 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:58,068 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:58,068 INFO  L85        PathProgramCache]: Analyzing trace with hash -720520022, now seen corresponding path program 1 times
[2025-03-16 19:39:58,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:58,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806758858]
[2025-03-16 19:39:58,068 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:58,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:58,084 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-16 19:39:58,100 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-16 19:39:58,101 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:58,101 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:58,197 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-16 19:39:58,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:58,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806758858]
[2025-03-16 19:39:58,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806758858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:58,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:58,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:58,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069327225]
[2025-03-16 19:39:58,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:58,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:58,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:58,200 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:58,200 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:58,200 INFO  L87              Difference]: Start difference. First operand 6222 states and 10225 transitions. Second operand  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-16 19:39:58,342 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:58,342 INFO  L93              Difference]: Finished difference Result 18284 states and 30120 transitions.
[2025-03-16 19:39:58,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:58,343 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-16 19:39:58,343 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:58,369 INFO  L225             Difference]: With dead ends: 18284
[2025-03-16 19:39:58,370 INFO  L226             Difference]: Without dead ends: 12254
[2025-03-16 19:39:58,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:58,382 INFO  L435           NwaCegarLoop]: 560 mSDtfsCounter, 752 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:58,383 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1893 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:58,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12254 states.
[2025-03-16 19:39:58,562 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 9214.
[2025-03-16 19:39:58,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9214 states, 9213 states have (on average 1.6419190274611961) internal successors, (15127), 9213 states have internal predecessors, (15127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:58,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15127 transitions.
[2025-03-16 19:39:58,608 INFO  L78                 Accepts]: Start accepts. Automaton has 9214 states and 15127 transitions. Word has length 131
[2025-03-16 19:39:58,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:58,608 INFO  L471      AbstractCegarLoop]: Abstraction has 9214 states and 15127 transitions.
[2025-03-16 19:39:58,609 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-16 19:39:58,609 INFO  L276                IsEmpty]: Start isEmpty. Operand 9214 states and 15127 transitions.
[2025-03-16 19:39:58,612 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-16 19:39:58,612 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:58,612 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-16 19:39:58,613 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 19:39:58,613 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:58,613 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:58,613 INFO  L85        PathProgramCache]: Analyzing trace with hash -859494748, now seen corresponding path program 1 times
[2025-03-16 19:39:58,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:58,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129562069]
[2025-03-16 19:39:58,614 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:58,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:58,633 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-16 19:39:58,652 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-16 19:39:58,652 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:58,652 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:58,742 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-16 19:39:58,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:58,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129562069]
[2025-03-16 19:39:58,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129562069] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:58,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:58,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:58,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354262844]
[2025-03-16 19:39:58,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:58,743 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:58,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:58,744 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:58,744 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:58,745 INFO  L87              Difference]: Start difference. First operand 9214 states and 15127 transitions. Second operand  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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-16 19:39:58,895 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:58,896 INFO  L93              Difference]: Finished difference Result 27108 states and 44608 transitions.
[2025-03-16 19:39:58,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:58,897 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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-16 19:39:58,897 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:58,931 INFO  L225             Difference]: With dead ends: 27108
[2025-03-16 19:39:58,932 INFO  L226             Difference]: Without dead ends: 18086
[2025-03-16 19:39:58,946 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:58,946 INFO  L435           NwaCegarLoop]: 559 mSDtfsCounter, 750 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:58,947 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1823 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:58,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18086 states.
[2025-03-16 19:39:59,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18086 to 13616.
[2025-03-16 19:39:59,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13616 states, 13615 states have (on average 1.6401762761659935) internal successors, (22331), 13615 states have internal predecessors, (22331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:59,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13616 states to 13616 states and 22331 transitions.
[2025-03-16 19:39:59,241 INFO  L78                 Accepts]: Start accepts. Automaton has 13616 states and 22331 transitions. Word has length 132
[2025-03-16 19:39:59,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:59,242 INFO  L471      AbstractCegarLoop]: Abstraction has 13616 states and 22331 transitions.
[2025-03-16 19:39:59,242 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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-16 19:39:59,242 INFO  L276                IsEmpty]: Start isEmpty. Operand 13616 states and 22331 transitions.
[2025-03-16 19:39:59,246 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-16 19:39:59,247 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:59,247 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, 1]
[2025-03-16 19:39:59,247 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 19:39:59,247 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:59,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:59,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -1147374808, now seen corresponding path program 1 times
[2025-03-16 19:39:59,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:59,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267507382]
[2025-03-16 19:39:59,248 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:59,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:59,270 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-16 19:39:59,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-16 19:39:59,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:59,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:59,407 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-16 19:39:59,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:59,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267507382]
[2025-03-16 19:39:59,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267507382] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:59,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:59,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:59,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57298604]
[2025-03-16 19:39:59,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:59,409 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:59,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:59,409 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:59,409 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:59,410 INFO  L87              Difference]: Start difference. First operand 13616 states and 22331 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:59,492 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:59,492 INFO  L93              Difference]: Finished difference Result 30327 states and 49937 transitions.
[2025-03-16 19:39:59,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:59,493 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-03-16 19:39:59,493 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:59,530 INFO  L225             Difference]: With dead ends: 30327
[2025-03-16 19:39:59,530 INFO  L226             Difference]: Without dead ends: 20900
[2025-03-16 19:39:59,548 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-16 19:39:59,549 INFO  L435           NwaCegarLoop]: 763 mSDtfsCounter, 235 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:59,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1288 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:59,565 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20900 states.
[2025-03-16 19:39:59,730 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20900 to 20898.
[2025-03-16 19:39:59,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20898 states, 20897 states have (on average 1.6395176341101594) internal successors, (34261), 20897 states have internal predecessors, (34261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:59,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20898 states to 20898 states and 34261 transitions.
[2025-03-16 19:39:59,873 INFO  L78                 Accepts]: Start accepts. Automaton has 20898 states and 34261 transitions. Word has length 133
[2025-03-16 19:39:59,873 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:59,873 INFO  L471      AbstractCegarLoop]: Abstraction has 20898 states and 34261 transitions.
[2025-03-16 19:39:59,873 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:59,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 20898 states and 34261 transitions.
[2025-03-16 19:39:59,875 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-16 19:39:59,875 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:59,875 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, 1]
[2025-03-16 19:39:59,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 19:39:59,876 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:59,876 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:59,876 INFO  L85        PathProgramCache]: Analyzing trace with hash 918692934, now seen corresponding path program 1 times
[2025-03-16 19:39:59,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:59,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352544934]
[2025-03-16 19:39:59,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:59,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:59,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-16 19:39:59,911 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-16 19:39:59,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:59,912 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:59,964 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-16 19:39:59,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:59,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352544934]
[2025-03-16 19:39:59,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352544934] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:59,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:59,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:59,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061881608]
[2025-03-16 19:39:59,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:59,965 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:59,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:59,966 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:59,966 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:59,966 INFO  L87              Difference]: Start difference. First operand 20898 states and 34261 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:00,130 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:00,131 INFO  L93              Difference]: Finished difference Result 46163 states and 75761 transitions.
[2025-03-16 19:40:00,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:40:00,132 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-03-16 19:40:00,132 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:00,187 INFO  L225             Difference]: With dead ends: 46163
[2025-03-16 19:40:00,187 INFO  L226             Difference]: Without dead ends: 31744
[2025-03-16 19:40:00,212 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-16 19:40:00,213 INFO  L435           NwaCegarLoop]: 737 mSDtfsCounter, 228 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:00,213 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:00,231 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31744 states.
[2025-03-16 19:40:00,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31744 to 31742.
[2025-03-16 19:40:00,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31742 states, 31741 states have (on average 1.6347311048801234) internal successors, (51888), 31741 states have internal predecessors, (51888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:00,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31742 states to 31742 states and 51888 transitions.
[2025-03-16 19:40:00,713 INFO  L78                 Accepts]: Start accepts. Automaton has 31742 states and 51888 transitions. Word has length 133
[2025-03-16 19:40:00,713 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:00,713 INFO  L471      AbstractCegarLoop]: Abstraction has 31742 states and 51888 transitions.
[2025-03-16 19:40:00,713 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:00,713 INFO  L276                IsEmpty]: Start isEmpty. Operand 31742 states and 51888 transitions.
[2025-03-16 19:40:00,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-16 19:40:00,715 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:00,715 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, 1]
[2025-03-16 19:40:00,715 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 19:40:00,715 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:00,716 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:00,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 1467561606, now seen corresponding path program 1 times
[2025-03-16 19:40:00,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:00,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307261783]
[2025-03-16 19:40:00,716 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:00,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:00,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-16 19:40:00,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-16 19:40:00,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:00,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:00,846 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-16 19:40:00,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:00,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307261783]
[2025-03-16 19:40:00,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307261783] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:00,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:00,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:40:00,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562084082]
[2025-03-16 19:40:00,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:00,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:40:00,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:00,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:40:00,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:40:00,847 INFO  L87              Difference]: Start difference. First operand 31742 states and 51888 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:01,060 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:01,061 INFO  L93              Difference]: Finished difference Result 62054 states and 101575 transitions.
[2025-03-16 19:40:01,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:40:01,061 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-03-16 19:40:01,062 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:01,148 INFO  L225             Difference]: With dead ends: 62054
[2025-03-16 19:40:01,148 INFO  L226             Difference]: Without dead ends: 44528
[2025-03-16 19:40:01,179 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-16 19:40:01,180 INFO  L435           NwaCegarLoop]: 649 mSDtfsCounter, 214 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:01,180 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:40:01,210 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44528 states.
[2025-03-16 19:40:01,701 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44528 to 44526.
[2025-03-16 19:40:01,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44526 states, 44525 states have (on average 1.6299831555306008) internal successors, (72575), 44525 states have internal predecessors, (72575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:01,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44526 states to 44526 states and 72575 transitions.
[2025-03-16 19:40:01,823 INFO  L78                 Accepts]: Start accepts. Automaton has 44526 states and 72575 transitions. Word has length 133
[2025-03-16 19:40:01,823 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:01,823 INFO  L471      AbstractCegarLoop]: Abstraction has 44526 states and 72575 transitions.
[2025-03-16 19:40:01,824 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:01,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 44526 states and 72575 transitions.
[2025-03-16 19:40:01,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-16 19:40:01,825 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:01,826 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, 1]
[2025-03-16 19:40:01,826 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 19:40:01,826 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:01,826 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:01,826 INFO  L85        PathProgramCache]: Analyzing trace with hash -872833331, now seen corresponding path program 1 times
[2025-03-16 19:40:01,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:01,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576413835]
[2025-03-16 19:40:01,827 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:01,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:01,845 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-16 19:40:01,863 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-16 19:40:01,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:01,863 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:01,954 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-16 19:40:01,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:01,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576413835]
[2025-03-16 19:40:01,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576413835] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:01,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:01,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:40:01,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362003870]
[2025-03-16 19:40:01,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:01,957 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:40:01,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:01,957 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:40:01,957 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:40:01,957 INFO  L87              Difference]: Start difference. First operand 44526 states and 72575 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:02,396 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:02,397 INFO  L93              Difference]: Finished difference Result 142152 states and 232071 transitions.
[2025-03-16 19:40:02,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:40:02,397 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-03-16 19:40:02,397 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:02,643 INFO  L225             Difference]: With dead ends: 142152
[2025-03-16 19:40:02,643 INFO  L226             Difference]: Without dead ends: 97906
[2025-03-16 19:40:02,705 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:40:02,706 INFO  L435           NwaCegarLoop]: 560 mSDtfsCounter, 748 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:02,706 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1897 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:02,780 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97906 states.
[2025-03-16 19:40:03,777 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97906 to 71082.
[2025-03-16 19:40:03,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71082 states, 71081 states have (on average 1.626271436811525) internal successors, (115597), 71081 states have internal predecessors, (115597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:04,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71082 states to 71082 states and 115597 transitions.
[2025-03-16 19:40:04,189 INFO  L78                 Accepts]: Start accepts. Automaton has 71082 states and 115597 transitions. Word has length 133
[2025-03-16 19:40:04,189 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:04,189 INFO  L471      AbstractCegarLoop]: Abstraction has 71082 states and 115597 transitions.
[2025-03-16 19:40:04,190 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:04,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 71082 states and 115597 transitions.
[2025-03-16 19:40:04,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-16 19:40:04,195 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:04,195 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, 1]
[2025-03-16 19:40:04,195 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 19:40:04,196 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:04,196 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:04,196 INFO  L85        PathProgramCache]: Analyzing trace with hash 2088261864, now seen corresponding path program 1 times
[2025-03-16 19:40:04,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:04,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005592940]
[2025-03-16 19:40:04,197 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:04,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:04,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-16 19:40:04,245 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-16 19:40:04,245 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:04,245 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:04,298 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-16 19:40:04,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:04,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005592940]
[2025-03-16 19:40:04,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005592940] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:04,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:04,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:40:04,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565598006]
[2025-03-16 19:40:04,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:04,299 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:40:04,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:04,300 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:40:04,300 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:40:04,300 INFO  L87              Difference]: Start difference. First operand 71082 states and 115597 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:04,803 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:04,804 INFO  L93              Difference]: Finished difference Result 155603 states and 253241 transitions.
[2025-03-16 19:40:04,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:40:04,804 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-03-16 19:40:04,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:04,967 INFO  L225             Difference]: With dead ends: 155603
[2025-03-16 19:40:04,968 INFO  L226             Difference]: Without dead ends: 105866
[2025-03-16 19:40:05,013 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-16 19:40:05,015 INFO  L435           NwaCegarLoop]: 703 mSDtfsCounter, 221 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:05,015 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1230 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:05,081 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105866 states.
[2025-03-16 19:40:06,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864.
[2025-03-16 19:40:06,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105864 states, 105863 states have (on average 1.618771431000444) internal successors, (171368), 105863 states have internal predecessors, (171368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:06,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 171368 transitions.
[2025-03-16 19:40:06,756 INFO  L78                 Accepts]: Start accepts. Automaton has 105864 states and 171368 transitions. Word has length 133
[2025-03-16 19:40:06,756 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:06,756 INFO  L471      AbstractCegarLoop]: Abstraction has 105864 states and 171368 transitions.
[2025-03-16 19:40:06,756 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:06,756 INFO  L276                IsEmpty]: Start isEmpty. Operand 105864 states and 171368 transitions.
[2025-03-16 19:40:06,760 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-16 19:40:06,761 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:06,761 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, 1, 1, 1]
[2025-03-16 19:40:06,761 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 19:40:06,761 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:06,761 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:06,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -1222725297, now seen corresponding path program 1 times
[2025-03-16 19:40:06,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:06,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139634166]
[2025-03-16 19:40:06,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:06,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:06,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-16 19:40:06,819 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-16 19:40:06,820 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:06,820 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:07,186 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-16 19:40:07,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:07,187 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139634166]
[2025-03-16 19:40:07,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139634166] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:07,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:07,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:40:07,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93305043]
[2025-03-16 19:40:07,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:07,188 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:40:07,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:07,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:40:07,188 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:40:07,188 INFO  L87              Difference]: Start difference. First operand 105864 states and 171368 transitions. Second operand  has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:07,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:07,804 INFO  L93              Difference]: Finished difference Result 211470 states and 342321 transitions.
[2025-03-16 19:40:07,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:40:07,805 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 135
[2025-03-16 19:40:07,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:08,147 INFO  L225             Difference]: With dead ends: 211470
[2025-03-16 19:40:08,147 INFO  L226             Difference]: Without dead ends: 105866
[2025-03-16 19:40:08,206 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-16 19:40:08,206 INFO  L435           NwaCegarLoop]: 568 mSDtfsCounter, 871 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:08,206 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2173 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:08,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105866 states.
[2025-03-16 19:40:09,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864.
[2025-03-16 19:40:09,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105864 states, 105863 states have (on average 1.612867574128827) internal successors, (170743), 105863 states have internal predecessors, (170743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:09,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 170743 transitions.
[2025-03-16 19:40:09,584 INFO  L78                 Accepts]: Start accepts. Automaton has 105864 states and 170743 transitions. Word has length 135
[2025-03-16 19:40:09,585 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:09,585 INFO  L471      AbstractCegarLoop]: Abstraction has 105864 states and 170743 transitions.
[2025-03-16 19:40:09,585 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:09,585 INFO  L276                IsEmpty]: Start isEmpty. Operand 105864 states and 170743 transitions.
[2025-03-16 19:40:09,585 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-03-16 19:40:09,586 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:09,586 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, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:09,586 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 19:40:09,586 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:09,586 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:09,586 INFO  L85        PathProgramCache]: Analyzing trace with hash 795844110, now seen corresponding path program 1 times
[2025-03-16 19:40:09,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:09,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005276620]
[2025-03-16 19:40:09,587 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:09,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:09,602 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-03-16 19:40:09,616 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-03-16 19:40:09,616 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:09,616 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:10,093 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-16 19:40:10,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:10,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005276620]
[2025-03-16 19:40:10,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005276620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:10,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:10,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:40:10,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792661222]
[2025-03-16 19:40:10,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:10,094 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:40:10,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:10,094 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:40:10,094 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:40:10,094 INFO  L87              Difference]: Start difference. First operand 105864 states and 170743 transitions. Second operand  has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:11,020 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:11,020 INFO  L93              Difference]: Finished difference Result 309468 states and 499581 transitions.
[2025-03-16 19:40:11,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:40:11,020 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138
[2025-03-16 19:40:11,021 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:11,330 INFO  L225             Difference]: With dead ends: 309468
[2025-03-16 19:40:11,330 INFO  L226             Difference]: Without dead ends: 203864
[2025-03-16 19:40:11,396 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-16 19:40:11,396 INFO  L435           NwaCegarLoop]: 559 mSDtfsCounter, 433 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:11,396 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 2182 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:11,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203864 states.
[2025-03-16 19:40:13,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203864 to 203862.
[2025-03-16 19:40:13,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203862 states, 203861 states have (on average 1.6051917728256018) internal successors, (327236), 203861 states have internal predecessors, (327236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:14,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203862 states to 203862 states and 327236 transitions.
[2025-03-16 19:40:14,098 INFO  L78                 Accepts]: Start accepts. Automaton has 203862 states and 327236 transitions. Word has length 138
[2025-03-16 19:40:14,099 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:14,099 INFO  L471      AbstractCegarLoop]: Abstraction has 203862 states and 327236 transitions.
[2025-03-16 19:40:14,099 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:14,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 203862 states and 327236 transitions.
[2025-03-16 19:40:14,099 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-03-16 19:40:14,099 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:14,099 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, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:14,100 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 19:40:14,100 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:14,100 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:14,100 INFO  L85        PathProgramCache]: Analyzing trace with hash -1097681060, now seen corresponding path program 1 times
[2025-03-16 19:40:14,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:14,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863595361]
[2025-03-16 19:40:14,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:14,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:14,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-03-16 19:40:14,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-03-16 19:40:14,193 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:14,193 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:14,879 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-16 19:40:14,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:14,881 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863595361]
[2025-03-16 19:40:14,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863595361] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:14,881 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:14,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 19:40:14,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891154532]
[2025-03-16 19:40:14,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:14,882 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 19:40:14,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:14,882 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 19:40:14,882 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:40:14,882 INFO  L87              Difference]: Start difference. First operand 203862 states and 327236 transitions. Second operand  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:15,685 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:15,686 INFO  L93              Difference]: Finished difference Result 207736 states and 333045 transitions.
[2025-03-16 19:40:15,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 19:40:15,687 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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 139
[2025-03-16 19:40:15,687 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:16,072 INFO  L225             Difference]: With dead ends: 207736
[2025-03-16 19:40:16,073 INFO  L226             Difference]: Without dead ends: 207734
[2025-03-16 19:40:16,126 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-16 19:40:16,126 INFO  L435           NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2255 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.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:16,126 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2255 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:40:16,273 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207734 states.
[2025-03-16 19:40:18,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207734 to 207734.
[2025-03-16 19:40:18,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 207734 states, 207733 states have (on average 1.5937814405992308) internal successors, (331081), 207733 states have internal predecessors, (331081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:19,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 207734 states to 207734 states and 331081 transitions.
[2025-03-16 19:40:19,112 INFO  L78                 Accepts]: Start accepts. Automaton has 207734 states and 331081 transitions. Word has length 139
[2025-03-16 19:40:19,112 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:19,112 INFO  L471      AbstractCegarLoop]: Abstraction has 207734 states and 331081 transitions.
[2025-03-16 19:40:19,112 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:19,112 INFO  L276                IsEmpty]: Start isEmpty. Operand 207734 states and 331081 transitions.
[2025-03-16 19:40:19,116 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-03-16 19:40:19,116 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:19,116 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:19,116 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 19:40:19,116 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:19,117 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:19,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 1361630219, now seen corresponding path program 1 times
[2025-03-16 19:40:19,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:19,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932928960]
[2025-03-16 19:40:19,122 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:19,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:19,164 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-03-16 19:40:19,195 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-03-16 19:40:19,195 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:19,195 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:19,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-16 19:40:19,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:19,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932928960]
[2025-03-16 19:40:19,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932928960] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:19,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:19,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:40:19,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043425754]
[2025-03-16 19:40:19,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:19,377 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:40:19,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:19,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:40:19,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:40:19,378 INFO  L87              Difference]: Start difference. First operand 207734 states and 331081 transitions. Second operand  has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:21,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:21,358 INFO  L93              Difference]: Finished difference Result 566806 states and 905942 transitions.
[2025-03-16 19:40:21,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:40:21,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175
[2025-03-16 19:40:21,359 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:22,225 INFO  L225             Difference]: With dead ends: 566806
[2025-03-16 19:40:22,226 INFO  L226             Difference]: Without dead ends: 474404
[2025-03-16 19:40:22,379 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2025-03-16 19:40:22,380 INFO  L435           NwaCegarLoop]: 815 mSDtfsCounter, 1691 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:22,380 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 3203 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:22,731 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 474404 states.
[2025-03-16 19:40:27,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 474404 to 334000.
[2025-03-16 19:40:27,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 334000 states, 333999 states have (on average 1.5922293180518505) internal successors, (531803), 333999 states have internal predecessors, (531803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:28,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 334000 states to 334000 states and 531803 transitions.
[2025-03-16 19:40:28,285 INFO  L78                 Accepts]: Start accepts. Automaton has 334000 states and 531803 transitions. Word has length 175
[2025-03-16 19:40:28,286 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:28,286 INFO  L471      AbstractCegarLoop]: Abstraction has 334000 states and 531803 transitions.
[2025-03-16 19:40:28,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:28,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 334000 states and 531803 transitions.
[2025-03-16 19:40:28,293 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-03-16 19:40:28,294 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:28,294 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:28,297 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 19:40:28,298 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:28,298 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:28,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -867269335, now seen corresponding path program 1 times
[2025-03-16 19:40:28,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:28,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020722294]
[2025-03-16 19:40:28,299 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:28,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:28,337 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-03-16 19:40:28,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-03-16 19:40:28,374 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:28,375 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:28,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-16 19:40:28,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:28,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020722294]
[2025-03-16 19:40:28,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020722294] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:28,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:28,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:40:28,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503171379]
[2025-03-16 19:40:28,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:28,542 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:40:28,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:28,542 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:40:28,542 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:40:28,543 INFO  L87              Difference]: Start difference. First operand 334000 states and 531803 transitions. Second operand  has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:31,083 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:31,083 INFO  L93              Difference]: Finished difference Result 637752 states and 1019458 transitions.
[2025-03-16 19:40:31,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:40:31,083 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 175
[2025-03-16 19:40:31,084 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:32,059 INFO  L225             Difference]: With dead ends: 637752
[2025-03-16 19:40:32,059 INFO  L226             Difference]: Without dead ends: 546500
[2025-03-16 19:40:32,222 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2025-03-16 19:40:32,223 INFO  L435           NwaCegarLoop]: 819 mSDtfsCounter, 1680 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:32,223 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 3426 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:32,634 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 546500 states.