./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e2c31a6d36722edb2a8cb670626aeeca5f235139fff7eadbabd05db5fa398d5d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 06:12:47,756 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 06:12:47,807 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 06:12:47,813 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 06:12:47,813 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 06:12:47,836 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 06:12:47,837 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 06:12:47,837 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 06:12:47,837 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 06:12:47,838 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 06:12:47,838 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 06:12:47,838 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 06:12:47,839 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 06:12:47,839 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 06:12:47,839 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 06:12:47,839 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 06:12:47,839 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 06:12:47,839 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 06:12:47,839 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 06:12:47,839 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 06:12:47,839 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 06:12:47,840 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 06:12:47,840 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 06:12:47,841 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 06:12:47,841 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 06:12:47,841 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 06:12:47,841 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 06:12:47,841 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 06:12:47,841 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 06:12:47,841 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 06:12:47,842 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 06:12:47,842 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 06:12:47,842 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 06:12:47,842 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 -> e2c31a6d36722edb2a8cb670626aeeca5f235139fff7eadbabd05db5fa398d5d
[2025-03-08 06:12:48,115 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 06:12:48,122 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 06:12:48,124 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 06:12:48,125 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 06:12:48,125 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 06:12:48,127 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c
[2025-03-08 06:12:49,252 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7b3952d/3541357b17494c01af36fb67a7c19ac9/FLAGa287da99c
[2025-03-08 06:12:49,591 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 06:12:49,593 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c
[2025-03-08 06:12:49,607 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7b3952d/3541357b17494c01af36fb67a7c19ac9/FLAGa287da99c
[2025-03-08 06:12:49,840 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7b3952d/3541357b17494c01af36fb67a7c19ac9
[2025-03-08 06:12:49,841 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 06:12:49,842 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 06:12:49,843 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 06:12:49,844 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 06:12:49,846 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 06:12:49,847 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:12:49" (1/1) ...
[2025-03-08 06:12:49,847 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686f5c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:49, skipping insertion in model container
[2025-03-08 06:12:49,848 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:12:49" (1/1) ...
[2025-03-08 06:12:49,874 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 06:12:50,117 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532]
[2025-03-08 06:12:50,197 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 06:12:50,220 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 06:12:50,275 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[14519,14532]
[2025-03-08 06:12:50,311 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 06:12:50,326 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 06:12:50,327 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50 WrapperNode
[2025-03-08 06:12:50,327 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 06:12:50,328 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 06:12:50,328 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 06:12:50,328 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 06:12:50,332 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,346 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,393 INFO  L138                Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1250
[2025-03-08 06:12:50,393 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 06:12:50,394 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 06:12:50,394 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 06:12:50,394 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 06:12:50,401 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,401 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,409 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,437 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 06:12:50,437 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,437 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,457 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,459 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,461 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,462 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,469 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 06:12:50,470 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 06:12:50,471 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 06:12:50,471 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 06:12:50,472 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (1/1) ...
[2025-03-08 06:12:50,478 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 06:12:50,488 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 06:12:50,503 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 06:12:50,506 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 06:12:50,526 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 06:12:50,526 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 06:12:50,526 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 06:12:50,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 06:12:50,626 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 06:12:50,627 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 06:12:51,522 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1101: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;
[2025-03-08 06:12:51,522 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;
[2025-03-08 06:12:51,522 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L840: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~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__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1;
[2025-03-08 06:12:51,522 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1303: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;
[2025-03-08 06:12:51,522 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~check__tmp~4#1;
[2025-03-08 06:12:51,565 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2025-03-08 06:12:51,565 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 06:12:51,579 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 06:12:51,581 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 06:12:51,581 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:12:51 BoogieIcfgContainer
[2025-03-08 06:12:51,582 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 06:12:51,584 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 06:12:51,584 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 06:12:51,587 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 06:12:51,588 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:12:49" (1/3) ...
[2025-03-08 06:12:51,588 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e75ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:12:51, skipping insertion in model container
[2025-03-08 06:12:51,588 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:50" (2/3) ...
[2025-03-08 06:12:51,588 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e75ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:12:51, skipping insertion in model container
[2025-03-08 06:12:51,589 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:12:51" (3/3) ...
[2025-03-08 06:12:51,590 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c
[2025-03-08 06:12:51,600 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 06:12:51,602 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 305 locations, 1 initial locations, 0 loop locations, and 1 error locations.
[2025-03-08 06:12:51,664 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 06:12:51,675 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;@27361a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 06:12:51,675 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 06:12:51,678 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:51,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-03-08 06:12:51,688 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:51,689 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:51,689 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:51,692 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:51,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -16826661, now seen corresponding path program 1 times
[2025-03-08 06:12:51,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:51,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339823118]
[2025-03-08 06:12:51,699 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:51,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:51,789 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-03-08 06:12:52,015 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-03-08 06:12:52,016 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:52,016 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:52,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:52,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:52,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339823118]
[2025-03-08 06:12:52,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339823118] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:52,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:52,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:12:52,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686249735]
[2025-03-08 06:12:52,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:52,595 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:12:52,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:52,610 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:12:52,610 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:52,613 INFO  L87              Difference]: Start difference. First operand  has 305 states, 303 states have (on average 1.7854785478547854) internal successors, (541), 304 states have internal predecessors, (541), 0 states have call successors, (0), 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 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:52,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:52,825 INFO  L93              Difference]: Finished difference Result 1458 states and 2600 transitions.
[2025-03-08 06:12:52,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:12:52,827 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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 144
[2025-03-08 06:12:52,827 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:52,846 INFO  L225             Difference]: With dead ends: 1458
[2025-03-08 06:12:52,848 INFO  L226             Difference]: Without dead ends: 1154
[2025-03-08 06:12:52,854 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-08 06:12:52,858 INFO  L435           NwaCegarLoop]: 918 mSDtfsCounter, 1573 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:52,859 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 2409 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:12:52,875 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1154 states.
[2025-03-08 06:12:52,914 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 581.
[2025-03-08 06:12:52,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 581 states, 580 states have (on average 1.453448275862069) internal successors, (843), 580 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:52,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 843 transitions.
[2025-03-08 06:12:52,921 INFO  L78                 Accepts]: Start accepts. Automaton has 581 states and 843 transitions. Word has length 144
[2025-03-08 06:12:52,922 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:52,923 INFO  L471      AbstractCegarLoop]: Abstraction has 581 states and 843 transitions.
[2025-03-08 06:12:52,924 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:52,924 INFO  L276                IsEmpty]: Start isEmpty. Operand 581 states and 843 transitions.
[2025-03-08 06:12:52,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-03-08 06:12:52,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:52,931 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, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:52,932 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 06:12:52,932 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:52,933 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:52,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -1180461674, now seen corresponding path program 1 times
[2025-03-08 06:12:52,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:52,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992434953]
[2025-03-08 06:12:52,934 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:52,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:52,968 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-03-08 06:12:52,978 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-03-08 06:12:52,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:52,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:53,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-08 06:12:53,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:53,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992434953]
[2025-03-08 06:12:53,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992434953] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:53,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:53,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:12:53,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487744916]
[2025-03-08 06:12:53,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:53,095 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:12:53,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:53,095 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:12:53,095 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:53,095 INFO  L87              Difference]: Start difference. First operand 581 states and 843 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,123 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:53,123 INFO  L93              Difference]: Finished difference Result 1136 states and 1643 transitions.
[2025-03-08 06:12:53,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:12:53,124 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145
[2025-03-08 06:12:53,124 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:53,126 INFO  L225             Difference]: With dead ends: 1136
[2025-03-08 06:12:53,126 INFO  L226             Difference]: Without dead ends: 583
[2025-03-08 06:12:53,128 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:53,128 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:53,128 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:53,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 583 states.
[2025-03-08 06:12:53,145 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583.
[2025-03-08 06:12:53,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 583 states, 582 states have (on average 1.4518900343642611) internal successors, (845), 582 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 845 transitions.
[2025-03-08 06:12:53,148 INFO  L78                 Accepts]: Start accepts. Automaton has 583 states and 845 transitions. Word has length 145
[2025-03-08 06:12:53,148 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:53,148 INFO  L471      AbstractCegarLoop]: Abstraction has 583 states and 845 transitions.
[2025-03-08 06:12:53,148 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,148 INFO  L276                IsEmpty]: Start isEmpty. Operand 583 states and 845 transitions.
[2025-03-08 06:12:53,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2025-03-08 06:12:53,153 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:53,154 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, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:53,154 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 06:12:53,154 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:53,154 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:53,155 INFO  L85        PathProgramCache]: Analyzing trace with hash -1158006792, now seen corresponding path program 1 times
[2025-03-08 06:12:53,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:53,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448912561]
[2025-03-08 06:12:53,155 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:53,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:53,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes.
[2025-03-08 06:12:53,187 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements.
[2025-03-08 06:12:53,188 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:53,188 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:53,294 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:53,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:53,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448912561]
[2025-03-08 06:12:53,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448912561] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:53,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:53,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:12:53,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366095834]
[2025-03-08 06:12:53,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:53,295 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:12:53,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:53,296 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:12:53,296 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:53,296 INFO  L87              Difference]: Start difference. First operand 583 states and 845 transitions. Second operand  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:53,338 INFO  L93              Difference]: Finished difference Result 1531 states and 2232 transitions.
[2025-03-08 06:12:53,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:12:53,339 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146
[2025-03-08 06:12:53,340 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:53,344 INFO  L225             Difference]: With dead ends: 1531
[2025-03-08 06:12:53,344 INFO  L226             Difference]: Without dead ends: 1126
[2025-03-08 06:12:53,345 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:53,347 INFO  L435           NwaCegarLoop]: 801 mSDtfsCounter, 371 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:53,347 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1204 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:53,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1126 states.
[2025-03-08 06:12:53,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124.
[2025-03-08 06:12:53,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1124 states, 1123 states have (on average 1.438112199465717) internal successors, (1615), 1123 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1615 transitions.
[2025-03-08 06:12:53,387 INFO  L78                 Accepts]: Start accepts. Automaton has 1124 states and 1615 transitions. Word has length 146
[2025-03-08 06:12:53,387 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:53,388 INFO  L471      AbstractCegarLoop]: Abstraction has 1124 states and 1615 transitions.
[2025-03-08 06:12:53,388 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,388 INFO  L276                IsEmpty]: Start isEmpty. Operand 1124 states and 1615 transitions.
[2025-03-08 06:12:53,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2025-03-08 06:12:53,392 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:53,392 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, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:53,392 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 06:12:53,393 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:53,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:53,395 INFO  L85        PathProgramCache]: Analyzing trace with hash -1698436298, now seen corresponding path program 1 times
[2025-03-08 06:12:53,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:53,395 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257878879]
[2025-03-08 06:12:53,395 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:53,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:53,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes.
[2025-03-08 06:12:53,502 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements.
[2025-03-08 06:12:53,505 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:53,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:53,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:53,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:53,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257878879]
[2025-03-08 06:12:53,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257878879] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:53,824 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:53,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:12:53,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756183843]
[2025-03-08 06:12:53,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:53,824 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:12:53,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:53,825 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:12:53,825 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:12:53,825 INFO  L87              Difference]: Start difference. First operand 1124 states and 1615 transitions. Second operand  has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:53,899 INFO  L93              Difference]: Finished difference Result 3114 states and 4476 transitions.
[2025-03-08 06:12:53,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:12:53,899 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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 146
[2025-03-08 06:12:53,899 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:53,906 INFO  L225             Difference]: With dead ends: 3114
[2025-03-08 06:12:53,907 INFO  L226             Difference]: Without dead ends: 2004
[2025-03-08 06:12:53,910 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:12:53,911 INFO  L435           NwaCegarLoop]: 762 mSDtfsCounter, 380 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:53,912 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1904 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:12:53,915 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2004 states.
[2025-03-08 06:12:53,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 2002.
[2025-03-08 06:12:53,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2002 states, 2001 states have (on average 1.4247876061969016) internal successors, (2851), 2001 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2851 transitions.
[2025-03-08 06:12:53,970 INFO  L78                 Accepts]: Start accepts. Automaton has 2002 states and 2851 transitions. Word has length 146
[2025-03-08 06:12:53,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:53,970 INFO  L471      AbstractCegarLoop]: Abstraction has 2002 states and 2851 transitions.
[2025-03-08 06:12:53,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:53,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 2002 states and 2851 transitions.
[2025-03-08 06:12:53,973 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2025-03-08 06:12:53,973 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:53,973 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, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:53,973 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 06:12:53,973 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:53,974 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:53,974 INFO  L85        PathProgramCache]: Analyzing trace with hash 749181587, now seen corresponding path program 1 times
[2025-03-08 06:12:53,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:53,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673753386]
[2025-03-08 06:12:53,974 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:53,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:53,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes.
[2025-03-08 06:12:54,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements.
[2025-03-08 06:12:54,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:54,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:54,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:54,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:54,373 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673753386]
[2025-03-08 06:12:54,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673753386] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:54,374 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:54,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:12:54,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804256973]
[2025-03-08 06:12:54,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:54,374 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:12:54,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:54,375 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:12:54,375 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:54,376 INFO  L87              Difference]: Start difference. First operand 2002 states and 2851 transitions. Second operand  has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:54,406 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:54,406 INFO  L93              Difference]: Finished difference Result 3397 states and 4845 transitions.
[2025-03-08 06:12:54,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:12:54,408 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 146
[2025-03-08 06:12:54,408 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:54,413 INFO  L225             Difference]: With dead ends: 3397
[2025-03-08 06:12:54,413 INFO  L226             Difference]: Without dead ends: 1567
[2025-03-08 06:12:54,417 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:54,418 INFO  L435           NwaCegarLoop]: 480 mSDtfsCounter, 20 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:54,418 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1394 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:54,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1567 states.
[2025-03-08 06:12:54,447 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1566.
[2025-03-08 06:12:54,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1566 states, 1565 states have (on average 1.415335463258786) internal successors, (2215), 1565 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:54,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2215 transitions.
[2025-03-08 06:12:54,455 INFO  L78                 Accepts]: Start accepts. Automaton has 1566 states and 2215 transitions. Word has length 146
[2025-03-08 06:12:54,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:54,456 INFO  L471      AbstractCegarLoop]: Abstraction has 1566 states and 2215 transitions.
[2025-03-08 06:12:54,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:54,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 1566 states and 2215 transitions.
[2025-03-08 06:12:54,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-03-08 06:12:54,459 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:54,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:54,459 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 06:12:54,459 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:54,460 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:54,460 INFO  L85        PathProgramCache]: Analyzing trace with hash 321507136, now seen corresponding path program 1 times
[2025-03-08 06:12:54,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:54,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980813768]
[2025-03-08 06:12:54,460 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:54,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:54,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-03-08 06:12:54,514 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-03-08 06:12:54,515 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:54,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:54,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:54,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:54,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980813768]
[2025-03-08 06:12:54,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980813768] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:54,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:54,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 06:12:54,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125024627]
[2025-03-08 06:12:54,945 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:54,945 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 06:12:54,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:54,948 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 06:12:54,948 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 06:12:54,949 INFO  L87              Difference]: Start difference. First operand 1566 states and 2215 transitions. Second operand  has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:55,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:55,095 INFO  L93              Difference]: Finished difference Result 3075 states and 4531 transitions.
[2025-03-08 06:12:55,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:12:55,096 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 0 states have call successors, (0), 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 154
[2025-03-08 06:12:55,097 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:55,105 INFO  L225             Difference]: With dead ends: 3075
[2025-03-08 06:12:55,106 INFO  L226             Difference]: Without dead ends: 2568
[2025-03-08 06:12:55,108 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 06:12:55,109 INFO  L435           NwaCegarLoop]: 521 mSDtfsCounter, 2472 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:55,109 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2472 Valid, 1138 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:12:55,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2568 states.
[2025-03-08 06:12:55,157 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2566.
[2025-03-08 06:12:55,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2566 states, 2565 states have (on average 1.4382066276803118) internal successors, (3689), 2565 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:55,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3689 transitions.
[2025-03-08 06:12:55,170 INFO  L78                 Accepts]: Start accepts. Automaton has 2566 states and 3689 transitions. Word has length 154
[2025-03-08 06:12:55,170 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:55,171 INFO  L471      AbstractCegarLoop]: Abstraction has 2566 states and 3689 transitions.
[2025-03-08 06:12:55,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:55,171 INFO  L276                IsEmpty]: Start isEmpty. Operand 2566 states and 3689 transitions.
[2025-03-08 06:12:55,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-03-08 06:12:55,174 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:55,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:55,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 06:12:55,175 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:55,175 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:55,175 INFO  L85        PathProgramCache]: Analyzing trace with hash 2096514498, now seen corresponding path program 1 times
[2025-03-08 06:12:55,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:55,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399878205]
[2025-03-08 06:12:55,175 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:55,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:55,192 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-03-08 06:12:55,266 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-03-08 06:12:55,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:55,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:55,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:55,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:55,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399878205]
[2025-03-08 06:12:55,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399878205] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:55,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:55,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-08 06:12:55,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328055686]
[2025-03-08 06:12:55,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:55,993 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-08 06:12:55,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:55,993 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-08 06:12:55,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240
[2025-03-08 06:12:55,994 INFO  L87              Difference]: Start difference. First operand 2566 states and 3689 transitions. Second operand  has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:57,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:57,175 INFO  L93              Difference]: Finished difference Result 10279 states and 15016 transitions.
[2025-03-08 06:12:57,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2025-03-08 06:12:57,176 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 0 states have call successors, (0), 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 154
[2025-03-08 06:12:57,177 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:57,207 INFO  L225             Difference]: With dead ends: 10279
[2025-03-08 06:12:57,207 INFO  L226             Difference]: Without dead ends: 9921
[2025-03-08 06:12:57,211 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122
[2025-03-08 06:12:57,212 INFO  L435           NwaCegarLoop]: 498 mSDtfsCounter, 5963 mSDsluCounter, 5060 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5963 SdHoareTripleChecker+Valid, 5558 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:57,212 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5963 Valid, 5558 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 06:12:57,222 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9921 states.
[2025-03-08 06:12:57,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9921 to 3406.
[2025-03-08 06:12:57,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3406 states, 3405 states have (on average 1.4070484581497797) internal successors, (4791), 3405 states have internal predecessors, (4791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:57,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4791 transitions.
[2025-03-08 06:12:57,350 INFO  L78                 Accepts]: Start accepts. Automaton has 3406 states and 4791 transitions. Word has length 154
[2025-03-08 06:12:57,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:57,350 INFO  L471      AbstractCegarLoop]: Abstraction has 3406 states and 4791 transitions.
[2025-03-08 06:12:57,351 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:57,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 3406 states and 4791 transitions.
[2025-03-08 06:12:57,355 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-03-08 06:12:57,355 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:57,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:57,356 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 06:12:57,356 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:57,356 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:57,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -71519874, now seen corresponding path program 1 times
[2025-03-08 06:12:57,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:57,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874986134]
[2025-03-08 06:12:57,357 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:57,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:57,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-03-08 06:12:57,412 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-03-08 06:12:57,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:57,413 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:57,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:57,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:57,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874986134]
[2025-03-08 06:12:57,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874986134] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:57,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:57,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:12:57,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543061605]
[2025-03-08 06:12:57,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:57,682 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:12:57,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:57,683 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:12:57,683 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:57,683 INFO  L87              Difference]: Start difference. First operand 3406 states and 4791 transitions. Second operand  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:57,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:57,716 INFO  L93              Difference]: Finished difference Result 5988 states and 8443 transitions.
[2025-03-08 06:12:57,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:12:57,716 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154
[2025-03-08 06:12:57,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:57,724 INFO  L225             Difference]: With dead ends: 5988
[2025-03-08 06:12:57,724 INFO  L226             Difference]: Without dead ends: 2785
[2025-03-08 06:12:57,727 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:57,728 INFO  L435           NwaCegarLoop]: 483 mSDtfsCounter, 23 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:57,728 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1398 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:57,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2785 states.
[2025-03-08 06:12:57,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2785.
[2025-03-08 06:12:57,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2785 states, 2784 states have (on average 1.4066091954022988) internal successors, (3916), 2784 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:57,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3916 transitions.
[2025-03-08 06:12:57,777 INFO  L78                 Accepts]: Start accepts. Automaton has 2785 states and 3916 transitions. Word has length 154
[2025-03-08 06:12:57,777 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:57,777 INFO  L471      AbstractCegarLoop]: Abstraction has 2785 states and 3916 transitions.
[2025-03-08 06:12:57,777 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:57,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 2785 states and 3916 transitions.
[2025-03-08 06:12:57,783 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-03-08 06:12:57,784 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:57,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:57,784 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 06:12:57,784 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:57,784 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:57,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 286885276, now seen corresponding path program 1 times
[2025-03-08 06:12:57,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:57,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157843262]
[2025-03-08 06:12:57,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:57,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:57,803 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-03-08 06:12:57,810 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-03-08 06:12:57,811 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:57,811 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:57,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:57,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:57,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157843262]
[2025-03-08 06:12:57,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157843262] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:57,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:57,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:12:57,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477277509]
[2025-03-08 06:12:57,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:57,865 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:12:57,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:57,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:12:57,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:57,866 INFO  L87              Difference]: Start difference. First operand 2785 states and 3916 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:57,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:57,915 INFO  L93              Difference]: Finished difference Result 6878 states and 9674 transitions.
[2025-03-08 06:12:57,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:12:57,916 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154
[2025-03-08 06:12:57,916 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:57,932 INFO  L225             Difference]: With dead ends: 6878
[2025-03-08 06:12:57,933 INFO  L226             Difference]: Without dead ends: 4512
[2025-03-08 06:12:57,936 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:57,936 INFO  L435           NwaCegarLoop]: 822 mSDtfsCounter, 365 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:57,937 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1215 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:57,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4512 states.
[2025-03-08 06:12:57,983 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4510.
[2025-03-08 06:12:57,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4510 states, 4509 states have (on average 1.3841206475937016) internal successors, (6241), 4509 states have internal predecessors, (6241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:58,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 6241 transitions.
[2025-03-08 06:12:58,002 INFO  L78                 Accepts]: Start accepts. Automaton has 4510 states and 6241 transitions. Word has length 154
[2025-03-08 06:12:58,002 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:58,002 INFO  L471      AbstractCegarLoop]: Abstraction has 4510 states and 6241 transitions.
[2025-03-08 06:12:58,003 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:58,003 INFO  L276                IsEmpty]: Start isEmpty. Operand 4510 states and 6241 transitions.
[2025-03-08 06:12:58,008 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-08 06:12:58,008 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:58,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:58,008 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 06:12:58,008 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:58,009 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:58,009 INFO  L85        PathProgramCache]: Analyzing trace with hash -1024299841, now seen corresponding path program 1 times
[2025-03-08 06:12:58,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:58,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416125003]
[2025-03-08 06:12:58,009 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:58,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:58,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-08 06:12:58,065 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-08 06:12:58,066 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:58,066 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:58,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:58,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:58,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416125003]
[2025-03-08 06:12:58,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416125003] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:58,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:58,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:12:58,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389842363]
[2025-03-08 06:12:58,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:58,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:12:58,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:58,255 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:12:58,255 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:58,255 INFO  L87              Difference]: Start difference. First operand 4510 states and 6241 transitions. Second operand  has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:58,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:58,395 INFO  L93              Difference]: Finished difference Result 21737 states and 29974 transitions.
[2025-03-08 06:12:58,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:12:58,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160
[2025-03-08 06:12:58,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:58,425 INFO  L225             Difference]: With dead ends: 21737
[2025-03-08 06:12:58,425 INFO  L226             Difference]: Without dead ends: 17266
[2025-03-08 06:12:58,436 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-08 06:12:58,437 INFO  L435           NwaCegarLoop]: 734 mSDtfsCounter, 1211 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:58,437 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1842 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:12:58,452 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17266 states.
[2025-03-08 06:12:58,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17266 to 8676.
[2025-03-08 06:12:58,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8676 states, 8675 states have (on average 1.3646109510086455) internal successors, (11838), 8675 states have internal predecessors, (11838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:58,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8676 states to 8676 states and 11838 transitions.
[2025-03-08 06:12:58,734 INFO  L78                 Accepts]: Start accepts. Automaton has 8676 states and 11838 transitions. Word has length 160
[2025-03-08 06:12:58,734 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:58,735 INFO  L471      AbstractCegarLoop]: Abstraction has 8676 states and 11838 transitions.
[2025-03-08 06:12:58,735 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:58,735 INFO  L276                IsEmpty]: Start isEmpty. Operand 8676 states and 11838 transitions.
[2025-03-08 06:12:58,751 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-08 06:12:58,751 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:58,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:58,751 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 06:12:58,752 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:58,752 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:58,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 718064682, now seen corresponding path program 1 times
[2025-03-08 06:12:58,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:58,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417320570]
[2025-03-08 06:12:58,753 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:58,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:58,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-08 06:12:58,784 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-08 06:12:58,784 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:58,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:58,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:58,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:58,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417320570]
[2025-03-08 06:12:58,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417320570] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:58,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:58,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:12:58,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704892363]
[2025-03-08 06:12:58,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:58,847 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:12:58,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:58,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:12:58,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:58,848 INFO  L87              Difference]: Start difference. First operand 8676 states and 11838 transitions. Second operand  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:58,919 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:58,920 INFO  L93              Difference]: Finished difference Result 17256 states and 23550 transitions.
[2025-03-08 06:12:58,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:12:58,920 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161
[2025-03-08 06:12:58,921 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:58,936 INFO  L225             Difference]: With dead ends: 17256
[2025-03-08 06:12:58,936 INFO  L226             Difference]: Without dead ends: 8682
[2025-03-08 06:12:58,946 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:58,947 INFO  L435           NwaCegarLoop]: 440 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:58,947 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:58,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8682 states.
[2025-03-08 06:12:59,059 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 8682.
[2025-03-08 06:12:59,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8682 states, 8681 states have (on average 1.364358944822025) internal successors, (11844), 8681 states have internal predecessors, (11844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:59,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8682 states to 8682 states and 11844 transitions.
[2025-03-08 06:12:59,099 INFO  L78                 Accepts]: Start accepts. Automaton has 8682 states and 11844 transitions. Word has length 161
[2025-03-08 06:12:59,099 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:59,099 INFO  L471      AbstractCegarLoop]: Abstraction has 8682 states and 11844 transitions.
[2025-03-08 06:12:59,100 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:59,100 INFO  L276                IsEmpty]: Start isEmpty. Operand 8682 states and 11844 transitions.
[2025-03-08 06:12:59,114 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2025-03-08 06:12:59,114 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:59,115 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:59,115 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 06:12:59,115 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:59,115 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:59,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 1614813815, now seen corresponding path program 1 times
[2025-03-08 06:12:59,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:59,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416816031]
[2025-03-08 06:12:59,116 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:59,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:59,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes.
[2025-03-08 06:12:59,170 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements.
[2025-03-08 06:12:59,171 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:59,171 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:59,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:59,476 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:59,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416816031]
[2025-03-08 06:12:59,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416816031] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:59,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:59,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:12:59,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657200362]
[2025-03-08 06:12:59,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:59,477 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:12:59,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:59,477 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:12:59,477 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:59,478 INFO  L87              Difference]: Start difference. First operand 8682 states and 11844 transitions. Second operand  has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:59,544 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:59,545 INFO  L93              Difference]: Finished difference Result 17260 states and 23553 transitions.
[2025-03-08 06:12:59,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:12:59,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162
[2025-03-08 06:12:59,546 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:59,565 INFO  L225             Difference]: With dead ends: 17260
[2025-03-08 06:12:59,566 INFO  L226             Difference]: Without dead ends: 8682
[2025-03-08 06:12:59,577 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:12:59,577 INFO  L435           NwaCegarLoop]: 464 mSDtfsCounter, 10 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:59,577 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1358 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:59,584 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8682 states.
[2025-03-08 06:12:59,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 8679.
[2025-03-08 06:12:59,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8679 states, 8678 states have (on average 1.3640239686563724) internal successors, (11837), 8678 states have internal predecessors, (11837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:59,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 11837 transitions.
[2025-03-08 06:12:59,727 INFO  L78                 Accepts]: Start accepts. Automaton has 8679 states and 11837 transitions. Word has length 162
[2025-03-08 06:12:59,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:12:59,727 INFO  L471      AbstractCegarLoop]: Abstraction has 8679 states and 11837 transitions.
[2025-03-08 06:12:59,727 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:59,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 8679 states and 11837 transitions.
[2025-03-08 06:12:59,737 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2025-03-08 06:12:59,737 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:12:59,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:12:59,738 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 06:12:59,738 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:12:59,738 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:12:59,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 2017511516, now seen corresponding path program 1 times
[2025-03-08 06:12:59,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:12:59,738 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672169011]
[2025-03-08 06:12:59,738 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:12:59,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:12:59,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes.
[2025-03-08 06:12:59,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements.
[2025-03-08 06:12:59,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:12:59,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:12:59,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:12:59,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:12:59,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672169011]
[2025-03-08 06:12:59,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672169011] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:12:59,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:12:59,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:12:59,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662028071]
[2025-03-08 06:12:59,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:12:59,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:12:59,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:12:59,818 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:12:59,818 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:59,818 INFO  L87              Difference]: Start difference. First operand 8679 states and 11837 transitions. Second operand  has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:12:59,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:12:59,949 INFO  L93              Difference]: Finished difference Result 24559 states and 33444 transitions.
[2025-03-08 06:12:59,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:12:59,949 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162
[2025-03-08 06:12:59,950 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:12:59,975 INFO  L225             Difference]: With dead ends: 24559
[2025-03-08 06:12:59,975 INFO  L226             Difference]: Without dead ends: 16747
[2025-03-08 06:12:59,985 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:12:59,985 INFO  L435           NwaCegarLoop]: 806 mSDtfsCounter, 354 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:12:59,986 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1203 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:12:59,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16747 states.
[2025-03-08 06:13:00,178 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16747 to 16745.
[2025-03-08 06:13:00,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16745 states, 16744 states have (on average 1.3420926899187768) internal successors, (22472), 16744 states have internal predecessors, (22472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:00,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16745 states to 16745 states and 22472 transitions.
[2025-03-08 06:13:00,239 INFO  L78                 Accepts]: Start accepts. Automaton has 16745 states and 22472 transitions. Word has length 162
[2025-03-08 06:13:00,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:00,239 INFO  L471      AbstractCegarLoop]: Abstraction has 16745 states and 22472 transitions.
[2025-03-08 06:13:00,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:00,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 16745 states and 22472 transitions.
[2025-03-08 06:13:00,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2025-03-08 06:13:00,257 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:00,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:00,258 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 06:13:00,258 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:00,258 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:00,258 INFO  L85        PathProgramCache]: Analyzing trace with hash 1406242458, now seen corresponding path program 1 times
[2025-03-08 06:13:00,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:00,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277235814]
[2025-03-08 06:13:00,259 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:00,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:00,274 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes.
[2025-03-08 06:13:00,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements.
[2025-03-08 06:13:00,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:00,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:00,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:00,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:00,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277235814]
[2025-03-08 06:13:00,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277235814] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:00,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:00,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:13:00,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238942656]
[2025-03-08 06:13:00,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:00,565 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:13:00,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:00,565 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:13:00,565 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:00,565 INFO  L87              Difference]: Start difference. First operand 16745 states and 22472 transitions. Second operand  has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:00,623 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:00,623 INFO  L93              Difference]: Finished difference Result 28850 states and 38779 transitions.
[2025-03-08 06:13:00,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:13:00,624 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162
[2025-03-08 06:13:00,624 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:00,644 INFO  L225             Difference]: With dead ends: 28850
[2025-03-08 06:13:00,644 INFO  L226             Difference]: Without dead ends: 12862
[2025-03-08 06:13:00,661 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:00,662 INFO  L435           NwaCegarLoop]: 467 mSDtfsCounter, 13 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:00,662 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1362 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:13:00,672 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12862 states.
[2025-03-08 06:13:00,790 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 12862.
[2025-03-08 06:13:00,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12862 states, 12861 states have (on average 1.3380763548713164) internal successors, (17209), 12861 states have internal predecessors, (17209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:00,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12862 states to 12862 states and 17209 transitions.
[2025-03-08 06:13:00,895 INFO  L78                 Accepts]: Start accepts. Automaton has 12862 states and 17209 transitions. Word has length 162
[2025-03-08 06:13:00,895 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:00,895 INFO  L471      AbstractCegarLoop]: Abstraction has 12862 states and 17209 transitions.
[2025-03-08 06:13:00,895 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:00,895 INFO  L276                IsEmpty]: Start isEmpty. Operand 12862 states and 17209 transitions.
[2025-03-08 06:13:00,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2025-03-08 06:13:00,906 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:00,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:00,907 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 06:13:00,907 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:00,907 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:00,907 INFO  L85        PathProgramCache]: Analyzing trace with hash -1550077630, now seen corresponding path program 1 times
[2025-03-08 06:13:00,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:00,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78106861]
[2025-03-08 06:13:00,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:00,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:00,931 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes.
[2025-03-08 06:13:00,943 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements.
[2025-03-08 06:13:00,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:00,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:01,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:01,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:01,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78106861]
[2025-03-08 06:13:01,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78106861] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:01,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:01,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:13:01,003 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444823339]
[2025-03-08 06:13:01,003 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:01,003 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:13:01,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:01,004 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:13:01,004 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:01,004 INFO  L87              Difference]: Start difference. First operand 12862 states and 17209 transitions. Second operand  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:01,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:01,235 INFO  L93              Difference]: Finished difference Result 31478 states and 42428 transitions.
[2025-03-08 06:13:01,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:13:01,235 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168
[2025-03-08 06:13:01,236 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:01,275 INFO  L225             Difference]: With dead ends: 31478
[2025-03-08 06:13:01,275 INFO  L226             Difference]: Without dead ends: 23106
[2025-03-08 06:13:01,292 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:01,292 INFO  L435           NwaCegarLoop]: 420 mSDtfsCounter, 268 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:01,293 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 740 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 06:13:01,313 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23106 states.
[2025-03-08 06:13:01,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23106 to 23104.
[2025-03-08 06:13:01,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23104 states, 23103 states have (on average 1.3299138640003463) internal successors, (30725), 23103 states have internal predecessors, (30725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:01,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23104 states to 23104 states and 30725 transitions.
[2025-03-08 06:13:01,650 INFO  L78                 Accepts]: Start accepts. Automaton has 23104 states and 30725 transitions. Word has length 168
[2025-03-08 06:13:01,651 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:01,651 INFO  L471      AbstractCegarLoop]: Abstraction has 23104 states and 30725 transitions.
[2025-03-08 06:13:01,651 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:01,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 23104 states and 30725 transitions.
[2025-03-08 06:13:01,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2025-03-08 06:13:01,676 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:01,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:01,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 06:13:01,677 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:01,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:01,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 2128397025, now seen corresponding path program 1 times
[2025-03-08 06:13:01,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:01,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810066805]
[2025-03-08 06:13:01,677 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:01,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:01,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes.
[2025-03-08 06:13:01,728 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements.
[2025-03-08 06:13:01,729 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:01,729 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:01,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:01,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:01,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810066805]
[2025-03-08 06:13:01,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810066805] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:01,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:01,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 06:13:01,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646998516]
[2025-03-08 06:13:01,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:01,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 06:13:01,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:01,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 06:13:01,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 06:13:01,985 INFO  L87              Difference]: Start difference. First operand 23104 states and 30725 transitions. Second operand  has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:02,270 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:02,271 INFO  L93              Difference]: Finished difference Result 48046 states and 66614 transitions.
[2025-03-08 06:13:02,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:13:02,271 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 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 168
[2025-03-08 06:13:02,272 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:02,330 INFO  L225             Difference]: With dead ends: 48046
[2025-03-08 06:13:02,330 INFO  L226             Difference]: Without dead ends: 38768
[2025-03-08 06:13:02,342 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 06:13:02,344 INFO  L435           NwaCegarLoop]: 482 mSDtfsCounter, 2690 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:02,344 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2690 Valid, 1061 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 06:13:02,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38768 states.
[2025-03-08 06:13:02,640 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38768 to 38766.
[2025-03-08 06:13:02,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38766 states, 38765 states have (on average 1.3497742809235134) internal successors, (52324), 38765 states have internal predecessors, (52324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:02,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38766 states to 38766 states and 52324 transitions.
[2025-03-08 06:13:02,722 INFO  L78                 Accepts]: Start accepts. Automaton has 38766 states and 52324 transitions. Word has length 168
[2025-03-08 06:13:02,723 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:02,723 INFO  L471      AbstractCegarLoop]: Abstraction has 38766 states and 52324 transitions.
[2025-03-08 06:13:02,723 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:02,723 INFO  L276                IsEmpty]: Start isEmpty. Operand 38766 states and 52324 transitions.
[2025-03-08 06:13:02,754 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2025-03-08 06:13:02,754 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:02,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:02,755 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 06:13:02,755 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:02,755 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:02,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -1743868445, now seen corresponding path program 1 times
[2025-03-08 06:13:02,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:02,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121209591]
[2025-03-08 06:13:02,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:02,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:02,772 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes.
[2025-03-08 06:13:02,820 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements.
[2025-03-08 06:13:02,822 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:02,822 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:03,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:03,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:03,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121209591]
[2025-03-08 06:13:03,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121209591] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:03,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:03,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:13:03,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195878064]
[2025-03-08 06:13:03,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:03,035 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:13:03,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:03,035 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:13:03,035 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:03,035 INFO  L87              Difference]: Start difference. First operand 38766 states and 52324 transitions. Second operand  has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:03,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:03,184 INFO  L93              Difference]: Finished difference Result 65126 states and 87864 transitions.
[2025-03-08 06:13:03,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:13:03,185 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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 168
[2025-03-08 06:13:03,185 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:03,236 INFO  L225             Difference]: With dead ends: 65126
[2025-03-08 06:13:03,236 INFO  L226             Difference]: Without dead ends: 36249
[2025-03-08 06:13:03,261 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-08 06:13:03,262 INFO  L435           NwaCegarLoop]: 484 mSDtfsCounter, 371 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:03,263 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1322 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:13:03,282 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36249 states.
[2025-03-08 06:13:03,547 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36249 to 36174.
[2025-03-08 06:13:03,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36174 states, 36173 states have (on average 1.3482155198628811) internal successors, (48769), 36173 states have internal predecessors, (48769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:03,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36174 states to 36174 states and 48769 transitions.
[2025-03-08 06:13:03,620 INFO  L78                 Accepts]: Start accepts. Automaton has 36174 states and 48769 transitions. Word has length 168
[2025-03-08 06:13:03,620 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:03,620 INFO  L471      AbstractCegarLoop]: Abstraction has 36174 states and 48769 transitions.
[2025-03-08 06:13:03,620 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:03,621 INFO  L276                IsEmpty]: Start isEmpty. Operand 36174 states and 48769 transitions.
[2025-03-08 06:13:03,640 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-08 06:13:03,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:03,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:03,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 06:13:03,641 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:03,641 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:03,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 770052642, now seen corresponding path program 1 times
[2025-03-08 06:13:03,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:03,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149577473]
[2025-03-08 06:13:03,642 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:03,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:03,658 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-08 06:13:03,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-08 06:13:03,670 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:03,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:03,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:03,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:03,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149577473]
[2025-03-08 06:13:03,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149577473] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:03,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:03,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:13:03,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314537845]
[2025-03-08 06:13:03,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:03,856 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:13:03,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:03,856 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:13:03,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:13:03,857 INFO  L87              Difference]: Start difference. First operand 36174 states and 48769 transitions. Second operand  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:04,073 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:04,073 INFO  L93              Difference]: Finished difference Result 51749 states and 72764 transitions.
[2025-03-08 06:13:04,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:13:04,074 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170
[2025-03-08 06:13:04,074 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:04,142 INFO  L225             Difference]: With dead ends: 51749
[2025-03-08 06:13:04,142 INFO  L226             Difference]: Without dead ends: 48882
[2025-03-08 06:13:04,158 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 06:13:04,159 INFO  L435           NwaCegarLoop]: 537 mSDtfsCounter, 950 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:04,159 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1480 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:13:04,184 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48882 states.
[2025-03-08 06:13:04,790 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48882 to 43230.
[2025-03-08 06:13:04,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43230 states, 43229 states have (on average 1.373406740845266) internal successors, (59371), 43229 states have internal predecessors, (59371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:04,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43230 states to 43230 states and 59371 transitions.
[2025-03-08 06:13:04,989 INFO  L78                 Accepts]: Start accepts. Automaton has 43230 states and 59371 transitions. Word has length 170
[2025-03-08 06:13:04,989 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:04,989 INFO  L471      AbstractCegarLoop]: Abstraction has 43230 states and 59371 transitions.
[2025-03-08 06:13:04,989 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:04,989 INFO  L276                IsEmpty]: Start isEmpty. Operand 43230 states and 59371 transitions.
[2025-03-08 06:13:05,047 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-08 06:13:05,047 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:05,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:05,047 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 06:13:05,047 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:05,048 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:05,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -241064608, now seen corresponding path program 1 times
[2025-03-08 06:13:05,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:05,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388372302]
[2025-03-08 06:13:05,048 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:05,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:05,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-08 06:13:05,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-08 06:13:05,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:05,084 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:05,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:05,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:05,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388372302]
[2025-03-08 06:13:05,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388372302] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:05,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:05,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:13:05,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643109933]
[2025-03-08 06:13:05,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:05,147 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:13:05,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:05,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:13:05,147 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:05,147 INFO  L87              Difference]: Start difference. First operand 43230 states and 59371 transitions. Second operand  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:05,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:05,420 INFO  L93              Difference]: Finished difference Result 94466 states and 133960 transitions.
[2025-03-08 06:13:05,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:13:05,420 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170
[2025-03-08 06:13:05,421 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:05,555 INFO  L225             Difference]: With dead ends: 94466
[2025-03-08 06:13:05,555 INFO  L226             Difference]: Without dead ends: 73614
[2025-03-08 06:13:05,590 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:05,590 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 250 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:05,591 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 863 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:13:05,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73614 states.
[2025-03-08 06:13:06,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73614 to 73612.
[2025-03-08 06:13:06,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73612 states, 73611 states have (on average 1.3795764220021465) internal successors, (101552), 73611 states have internal predecessors, (101552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:07,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73612 states to 73612 states and 101552 transitions.
[2025-03-08 06:13:07,010 INFO  L78                 Accepts]: Start accepts. Automaton has 73612 states and 101552 transitions. Word has length 170
[2025-03-08 06:13:07,010 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:07,010 INFO  L471      AbstractCegarLoop]: Abstraction has 73612 states and 101552 transitions.
[2025-03-08 06:13:07,010 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:07,011 INFO  L276                IsEmpty]: Start isEmpty. Operand 73612 states and 101552 transitions.
[2025-03-08 06:13:07,048 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-08 06:13:07,048 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:07,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:07,048 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 06:13:07,048 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:07,049 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:07,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 1347283294, now seen corresponding path program 1 times
[2025-03-08 06:13:07,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:07,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875205471]
[2025-03-08 06:13:07,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:07,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:07,064 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-08 06:13:07,073 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-08 06:13:07,074 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:07,074 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:07,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:07,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:07,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875205471]
[2025-03-08 06:13:07,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875205471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:07,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:07,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:13:07,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320522074]
[2025-03-08 06:13:07,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:07,147 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:13:07,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:07,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:13:07,147 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:13:07,147 INFO  L87              Difference]: Start difference. First operand 73612 states and 101552 transitions. Second operand  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:07,742 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:07,742 INFO  L93              Difference]: Finished difference Result 166825 states and 247199 transitions.
[2025-03-08 06:13:07,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 06:13:07,743 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170
[2025-03-08 06:13:07,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:07,943 INFO  L225             Difference]: With dead ends: 166825
[2025-03-08 06:13:07,943 INFO  L226             Difference]: Without dead ends: 135560
[2025-03-08 06:13:08,252 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 06:13:08,252 INFO  L435           NwaCegarLoop]: 810 mSDtfsCounter, 1128 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:08,253 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 2110 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 06:13:08,320 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 135560 states.
[2025-03-08 06:13:09,550 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 135560 to 98641.
[2025-03-08 06:13:09,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98641 states, 98640 states have (on average 1.4179947283049472) internal successors, (139871), 98640 states have internal predecessors, (139871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:09,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98641 states to 98641 states and 139871 transitions.
[2025-03-08 06:13:09,804 INFO  L78                 Accepts]: Start accepts. Automaton has 98641 states and 139871 transitions. Word has length 170
[2025-03-08 06:13:09,804 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:09,804 INFO  L471      AbstractCegarLoop]: Abstraction has 98641 states and 139871 transitions.
[2025-03-08 06:13:09,804 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:09,805 INFO  L276                IsEmpty]: Start isEmpty. Operand 98641 states and 139871 transitions.
[2025-03-08 06:13:09,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-08 06:13:09,849 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:09,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:09,850 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 06:13:09,850 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:09,850 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:09,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 213337310, now seen corresponding path program 1 times
[2025-03-08 06:13:09,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:09,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268929696]
[2025-03-08 06:13:09,850 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:09,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:09,868 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-08 06:13:09,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-08 06:13:09,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:09,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:10,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:10,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:10,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268929696]
[2025-03-08 06:13:10,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268929696] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:10,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:10,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-08 06:13:10,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160141566]
[2025-03-08 06:13:10,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:10,725 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-08 06:13:10,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:10,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-08 06:13:10,726 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240
[2025-03-08 06:13:10,727 INFO  L87              Difference]: Start difference. First operand 98641 states and 139871 transitions. Second operand  has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:12,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:12,899 INFO  L93              Difference]: Finished difference Result 196711 states and 285354 transitions.
[2025-03-08 06:13:12,900 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2025-03-08 06:13:12,900 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 0 states have call successors, (0), 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 170
[2025-03-08 06:13:12,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:13,181 INFO  L225             Difference]: With dead ends: 196711
[2025-03-08 06:13:13,182 INFO  L226             Difference]: Without dead ends: 171089
[2025-03-08 06:13:13,269 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=469, Invalid=1423, Unknown=0, NotChecked=0, Total=1892
[2025-03-08 06:13:13,270 INFO  L435           NwaCegarLoop]: 603 mSDtfsCounter, 4234 mSDsluCounter, 6771 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4234 SdHoareTripleChecker+Valid, 7374 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:13,270 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4234 Valid, 7374 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 06:13:13,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171089 states.
[2025-03-08 06:13:15,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171089 to 103498.
[2025-03-08 06:13:15,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103498 states, 103497 states have (on average 1.408369324714726) internal successors, (145762), 103497 states have internal predecessors, (145762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:15,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103498 states to 103498 states and 145762 transitions.
[2025-03-08 06:13:15,749 INFO  L78                 Accepts]: Start accepts. Automaton has 103498 states and 145762 transitions. Word has length 170
[2025-03-08 06:13:15,749 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:15,749 INFO  L471      AbstractCegarLoop]: Abstraction has 103498 states and 145762 transitions.
[2025-03-08 06:13:15,750 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:15,750 INFO  L276                IsEmpty]: Start isEmpty. Operand 103498 states and 145762 transitions.
[2025-03-08 06:13:15,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-08 06:13:15,785 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:15,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:15,786 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 06:13:15,786 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:15,786 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:15,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 893395680, now seen corresponding path program 1 times
[2025-03-08 06:13:15,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:15,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374567626]
[2025-03-08 06:13:15,787 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:15,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:15,800 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-08 06:13:15,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-08 06:13:15,846 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:15,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:16,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:16,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:16,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374567626]
[2025-03-08 06:13:16,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374567626] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:16,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:16,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:13:16,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514700749]
[2025-03-08 06:13:16,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:16,256 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:13:16,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:16,256 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:13:16,256 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:16,256 INFO  L87              Difference]: Start difference. First operand 103498 states and 145762 transitions. Second operand  has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:16,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:16,836 INFO  L93              Difference]: Finished difference Result 219301 states and 309279 transitions.
[2025-03-08 06:13:16,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:13:16,836 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 170
[2025-03-08 06:13:16,836 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:17,055 INFO  L225             Difference]: With dead ends: 219301
[2025-03-08 06:13:17,055 INFO  L226             Difference]: Without dead ends: 142234
[2025-03-08 06:13:17,375 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:17,377 INFO  L435           NwaCegarLoop]: 700 mSDtfsCounter, 812 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:17,377 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1441 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:13:17,436 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 142234 states.
[2025-03-08 06:13:18,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 142234 to 103680.
[2025-03-08 06:13:18,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103680 states, 103679 states have (on average 1.4080189816645607) internal successors, (145982), 103679 states have internal predecessors, (145982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:19,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103680 states to 103680 states and 145982 transitions.
[2025-03-08 06:13:19,066 INFO  L78                 Accepts]: Start accepts. Automaton has 103680 states and 145982 transitions. Word has length 170
[2025-03-08 06:13:19,066 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:19,066 INFO  L471      AbstractCegarLoop]: Abstraction has 103680 states and 145982 transitions.
[2025-03-08 06:13:19,066 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:19,066 INFO  L276                IsEmpty]: Start isEmpty. Operand 103680 states and 145982 transitions.
[2025-03-08 06:13:19,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2025-03-08 06:13:19,103 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:19,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:19,103 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-08 06:13:19,103 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:19,104 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:19,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 2121885921, now seen corresponding path program 1 times
[2025-03-08 06:13:19,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:19,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790676116]
[2025-03-08 06:13:19,104 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:19,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:19,121 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-08 06:13:19,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-08 06:13:19,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:19,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:19,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:19,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:19,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790676116]
[2025-03-08 06:13:19,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790676116] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:19,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:19,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:13:19,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506313222]
[2025-03-08 06:13:19,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:19,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:13:19,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:19,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:13:19,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:19,387 INFO  L87              Difference]: Start difference. First operand 103680 states and 145982 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:19,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:19,794 INFO  L93              Difference]: Finished difference Result 206789 states and 291297 transitions.
[2025-03-08 06:13:19,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:13:19,794 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171
[2025-03-08 06:13:19,795 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:19,955 INFO  L225             Difference]: With dead ends: 206789
[2025-03-08 06:13:19,955 INFO  L226             Difference]: Without dead ends: 103696
[2025-03-08 06:13:20,037 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:20,037 INFO  L435           NwaCegarLoop]: 436 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:20,038 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 866 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:13:20,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103696 states.
[2025-03-08 06:13:21,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103696 to 103696.
[2025-03-08 06:13:21,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103696 states, 103695 states have (on average 1.4079560248806595) internal successors, (145998), 103695 states have internal predecessors, (145998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:21,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103696 states to 103696 states and 145998 transitions.
[2025-03-08 06:13:21,756 INFO  L78                 Accepts]: Start accepts. Automaton has 103696 states and 145998 transitions. Word has length 171
[2025-03-08 06:13:21,756 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:21,756 INFO  L471      AbstractCegarLoop]: Abstraction has 103696 states and 145998 transitions.
[2025-03-08 06:13:21,757 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:21,757 INFO  L276                IsEmpty]: Start isEmpty. Operand 103696 states and 145998 transitions.
[2025-03-08 06:13:21,807 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-03-08 06:13:21,807 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:21,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:21,807 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 06:13:21,807 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:21,808 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:21,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -1402816680, now seen corresponding path program 1 times
[2025-03-08 06:13:21,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:21,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319729672]
[2025-03-08 06:13:21,808 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:21,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:21,829 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-08 06:13:21,856 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-08 06:13:21,856 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:21,856 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:22,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:22,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:22,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319729672]
[2025-03-08 06:13:22,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319729672] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:22,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:22,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:13:22,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216897356]
[2025-03-08 06:13:22,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:22,318 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:13:22,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:22,319 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:13:22,319 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:22,319 INFO  L87              Difference]: Start difference. First operand 103696 states and 145998 transitions. Second operand  has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:22,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:22,778 INFO  L93              Difference]: Finished difference Result 207280 states and 291843 transitions.
[2025-03-08 06:13:22,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:13:22,778 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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 172
[2025-03-08 06:13:22,778 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:22,918 INFO  L225             Difference]: With dead ends: 207280
[2025-03-08 06:13:22,918 INFO  L226             Difference]: Without dead ends: 103680
[2025-03-08 06:13:22,996 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:22,996 INFO  L435           NwaCegarLoop]: 455 mSDtfsCounter, 4 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:22,996 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1336 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:13:23,061 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103680 states.
[2025-03-08 06:13:24,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103680 to 103680.
[2025-03-08 06:13:24,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103680 states, 103679 states have (on average 1.4079128849622393) internal successors, (145971), 103679 states have internal predecessors, (145971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:24,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103680 states to 103680 states and 145971 transitions.
[2025-03-08 06:13:24,466 INFO  L78                 Accepts]: Start accepts. Automaton has 103680 states and 145971 transitions. Word has length 172
[2025-03-08 06:13:24,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:24,466 INFO  L471      AbstractCegarLoop]: Abstraction has 103680 states and 145971 transitions.
[2025-03-08 06:13:24,466 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:24,466 INFO  L276                IsEmpty]: Start isEmpty. Operand 103680 states and 145971 transitions.
[2025-03-08 06:13:24,502 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-03-08 06:13:24,502 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:24,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:24,502 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-08 06:13:24,502 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:24,502 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:24,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457515197, now seen corresponding path program 1 times
[2025-03-08 06:13:24,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:24,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292452316]
[2025-03-08 06:13:24,503 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:24,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:24,516 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-08 06:13:24,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-08 06:13:24,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:24,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:25,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:25,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:25,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292452316]
[2025-03-08 06:13:25,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292452316] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:25,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:25,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:13:25,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018077664]
[2025-03-08 06:13:25,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:25,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:13:25,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:25,041 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:13:25,041 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:25,041 INFO  L87              Difference]: Start difference. First operand 103680 states and 145971 transitions. Second operand  has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:25,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:25,480 INFO  L93              Difference]: Finished difference Result 166413 states and 234578 transitions.
[2025-03-08 06:13:25,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:13:25,481 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 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 172
[2025-03-08 06:13:25,481 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:25,609 INFO  L225             Difference]: With dead ends: 166413
[2025-03-08 06:13:25,609 INFO  L226             Difference]: Without dead ends: 90755
[2025-03-08 06:13:25,677 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:13:25,677 INFO  L435           NwaCegarLoop]: 702 mSDtfsCounter, 721 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:25,678 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1079 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:13:25,739 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90755 states.
[2025-03-08 06:13:27,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90755 to 90258.
[2025-03-08 06:13:27,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90258 states, 90257 states have (on average 1.4047663893105244) internal successors, (126790), 90257 states have internal predecessors, (126790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:27,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90258 states to 90258 states and 126790 transitions.
[2025-03-08 06:13:27,239 INFO  L78                 Accepts]: Start accepts. Automaton has 90258 states and 126790 transitions. Word has length 172
[2025-03-08 06:13:27,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:27,239 INFO  L471      AbstractCegarLoop]: Abstraction has 90258 states and 126790 transitions.
[2025-03-08 06:13:27,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:27,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 90258 states and 126790 transitions.
[2025-03-08 06:13:27,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-03-08 06:13:27,269 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:27,269 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:27,269 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-08 06:13:27,270 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:27,270 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:27,270 INFO  L85        PathProgramCache]: Analyzing trace with hash -1392679780, now seen corresponding path program 1 times
[2025-03-08 06:13:27,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:27,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894514615]
[2025-03-08 06:13:27,270 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:27,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:27,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-08 06:13:27,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-08 06:13:27,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:27,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:27,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:27,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:27,320 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894514615]
[2025-03-08 06:13:27,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894514615] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:27,320 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:27,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:13:27,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354822383]
[2025-03-08 06:13:27,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:27,320 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:13:27,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:27,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:13:27,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:27,321 INFO  L87              Difference]: Start difference. First operand 90258 states and 126790 transitions. Second operand  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:27,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:27,756 INFO  L93              Difference]: Finished difference Result 197035 states and 276532 transitions.
[2025-03-08 06:13:27,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:13:27,757 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173
[2025-03-08 06:13:27,757 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:27,947 INFO  L225             Difference]: With dead ends: 197035
[2025-03-08 06:13:27,947 INFO  L226             Difference]: Without dead ends: 131723
[2025-03-08 06:13:28,024 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:28,025 INFO  L435           NwaCegarLoop]: 743 mSDtfsCounter, 389 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:28,025 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1171 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:13:28,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 131723 states.
[2025-03-08 06:13:29,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 131723 to 90261.
[2025-03-08 06:13:29,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90261 states, 90260 states have (on average 1.4046864613339243) internal successors, (126787), 90260 states have internal predecessors, (126787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:29,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90261 states to 90261 states and 126787 transitions.
[2025-03-08 06:13:29,814 INFO  L78                 Accepts]: Start accepts. Automaton has 90261 states and 126787 transitions. Word has length 173
[2025-03-08 06:13:29,814 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:29,814 INFO  L471      AbstractCegarLoop]: Abstraction has 90261 states and 126787 transitions.
[2025-03-08 06:13:29,814 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:29,814 INFO  L276                IsEmpty]: Start isEmpty. Operand 90261 states and 126787 transitions.
[2025-03-08 06:13:29,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-03-08 06:13:29,866 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:29,867 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:29,867 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-08 06:13:29,867 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:29,867 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:29,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -792075400, now seen corresponding path program 1 times
[2025-03-08 06:13:29,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:29,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162780398]
[2025-03-08 06:13:29,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:29,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:29,887 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-03-08 06:13:29,905 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-03-08 06:13:29,905 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:29,905 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:29,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:29,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:29,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162780398]
[2025-03-08 06:13:29,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162780398] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:29,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:29,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:13:29,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106717612]
[2025-03-08 06:13:29,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:29,957 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:13:29,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:29,958 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:13:29,958 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:29,958 INFO  L87              Difference]: Start difference. First operand 90261 states and 126787 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 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-08 06:13:30,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:30,967 INFO  L93              Difference]: Finished difference Result 242992 states and 345368 transitions.
[2025-03-08 06:13:30,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:13:30,967 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 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 174
[2025-03-08 06:13:30,968 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:31,208 INFO  L225             Difference]: With dead ends: 242992
[2025-03-08 06:13:31,208 INFO  L226             Difference]: Without dead ends: 169359
[2025-03-08 06:13:31,266 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:13:31,267 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 240 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:31,267 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 731 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:13:31,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169359 states.
[2025-03-08 06:13:33,080 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169359 to 169357.
[2025-03-08 06:13:33,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 169357 states, 169356 states have (on average 1.4013498193155247) internal successors, (237327), 169356 states have internal predecessors, (237327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:33,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169357 states to 169357 states and 237327 transitions.
[2025-03-08 06:13:33,499 INFO  L78                 Accepts]: Start accepts. Automaton has 169357 states and 237327 transitions. Word has length 174
[2025-03-08 06:13:33,499 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:33,499 INFO  L471      AbstractCegarLoop]: Abstraction has 169357 states and 237327 transitions.
[2025-03-08 06:13:33,499 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 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-08 06:13:33,500 INFO  L276                IsEmpty]: Start isEmpty. Operand 169357 states and 237327 transitions.
[2025-03-08 06:13:33,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-03-08 06:13:33,953 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:33,953 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:33,953 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-08 06:13:33,953 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:33,954 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:33,954 INFO  L85        PathProgramCache]: Analyzing trace with hash -244355431, now seen corresponding path program 1 times
[2025-03-08 06:13:33,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:33,954 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735639798]
[2025-03-08 06:13:33,954 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:33,954 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:33,970 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-03-08 06:13:33,985 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-03-08 06:13:33,986 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:33,986 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:34,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:34,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:34,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735639798]
[2025-03-08 06:13:34,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735639798] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:34,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:34,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:13:34,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187409865]
[2025-03-08 06:13:34,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:34,075 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:13:34,075 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:34,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:13:34,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:13:34,075 INFO  L87              Difference]: Start difference. First operand 169357 states and 237327 transitions. Second operand  has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 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-08 06:13:34,750 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:34,750 INFO  L93              Difference]: Finished difference Result 218279 states and 306456 transitions.
[2025-03-08 06:13:34,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:13:34,751 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 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 174
[2025-03-08 06:13:34,751 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:34,880 INFO  L225             Difference]: With dead ends: 218279
[2025-03-08 06:13:34,880 INFO  L226             Difference]: Without dead ends: 90261
[2025-03-08 06:13:34,971 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 06:13:34,971 INFO  L435           NwaCegarLoop]: 320 mSDtfsCounter, 1116 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:34,971 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 404 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:13:35,037 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90261 states.
[2025-03-08 06:13:36,260 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90261 to 90261.
[2025-03-08 06:13:36,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90261 states, 90260 states have (on average 1.3849767338799026) internal successors, (125008), 90260 states have internal predecessors, (125008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:36,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90261 states to 90261 states and 125008 transitions.
[2025-03-08 06:13:36,452 INFO  L78                 Accepts]: Start accepts. Automaton has 90261 states and 125008 transitions. Word has length 174
[2025-03-08 06:13:36,452 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:36,452 INFO  L471      AbstractCegarLoop]: Abstraction has 90261 states and 125008 transitions.
[2025-03-08 06:13:36,452 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 4 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-08 06:13:36,452 INFO  L276                IsEmpty]: Start isEmpty. Operand 90261 states and 125008 transitions.
[2025-03-08 06:13:36,702 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-03-08 06:13:36,702 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:36,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:36,702 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-08 06:13:36,702 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:36,703 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:36,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 2054377145, now seen corresponding path program 1 times
[2025-03-08 06:13:36,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:36,703 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38355120]
[2025-03-08 06:13:36,703 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:36,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:36,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-03-08 06:13:36,725 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-03-08 06:13:36,725 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:36,725 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:36,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:36,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:36,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38355120]
[2025-03-08 06:13:36,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38355120] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:36,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:36,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 06:13:36,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636947861]
[2025-03-08 06:13:36,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:36,913 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 06:13:36,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:36,914 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 06:13:36,914 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-03-08 06:13:36,914 INFO  L87              Difference]: Start difference. First operand 90261 states and 125008 transitions. Second operand  has 10 states, 10 states have (on average 17.4) internal successors, (174), 9 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-08 06:13:37,333 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:13:37,334 INFO  L93              Difference]: Finished difference Result 161169 states and 227103 transitions.
[2025-03-08 06:13:37,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:13:37,334 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 17.4) internal successors, (174), 9 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 174
[2025-03-08 06:13:37,334 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:13:37,436 INFO  L225             Difference]: With dead ends: 161169
[2025-03-08 06:13:37,437 INFO  L226             Difference]: Without dead ends: 76102
[2025-03-08 06:13:37,499 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2025-03-08 06:13:37,499 INFO  L435           NwaCegarLoop]: 320 mSDtfsCounter, 2702 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:13:37,500 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 594 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:13:37,547 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76102 states.
[2025-03-08 06:13:38,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76102 to 49570.
[2025-03-08 06:13:38,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49570 states, 49569 states have (on average 1.3649458330811597) internal successors, (67659), 49569 states have internal predecessors, (67659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:13:38,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49570 states to 49570 states and 67659 transitions.
[2025-03-08 06:13:38,463 INFO  L78                 Accepts]: Start accepts. Automaton has 49570 states and 67659 transitions. Word has length 174
[2025-03-08 06:13:38,464 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:13:38,464 INFO  L471      AbstractCegarLoop]: Abstraction has 49570 states and 67659 transitions.
[2025-03-08 06:13:38,464 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 17.4) internal successors, (174), 9 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-08 06:13:38,464 INFO  L276                IsEmpty]: Start isEmpty. Operand 49570 states and 67659 transitions.
[2025-03-08 06:13:38,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-03-08 06:13:38,480 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:13:38,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:13:38,480 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-08 06:13:38,481 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:13:38,481 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:13:38,481 INFO  L85        PathProgramCache]: Analyzing trace with hash 1402266810, now seen corresponding path program 1 times
[2025-03-08 06:13:38,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:13:38,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958677380]
[2025-03-08 06:13:38,481 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:13:38,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:13:38,493 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-03-08 06:13:38,505 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-03-08 06:13:38,505 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:13:38,505 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:13:38,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:13:38,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:13:38,938 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958677380]
[2025-03-08 06:13:38,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958677380] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:13:38,939 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:13:38,939 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 06:13:38,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084459146]
[2025-03-08 06:13:38,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:13:38,939 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 06:13:38,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:13:38,940 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 06:13:38,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-08 06:13:38,940 INFO  L87              Difference]: Start difference. First operand 49570 states and 67659 transitions. Second operand  has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 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)