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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37e549e4fa4b7b530556a3e37b4e2d4806fbb92dab5da0115a6c327b48fa0370
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 19:39:27,144 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 19:39:27,195 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 19:39:27,199 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 19:39:27,199 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 19:39:27,221 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 19:39:27,223 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 19:39:27,223 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 19:39:27,223 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 19:39:27,223 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 19:39:27,224 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 19:39:27,224 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 19:39:27,224 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 19:39:27,224 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 19:39:27,224 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 19:39:27,224 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 19:39:27,224 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 19:39:27,224 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 19:39:27,224 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 19:39:27,225 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 19:39:27,225 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 19:39:27,225 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 19:39:27,226 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 19:39:27,226 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 19:39:27,226 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 -> 37e549e4fa4b7b530556a3e37b4e2d4806fbb92dab5da0115a6c327b48fa0370
[2025-03-16 19:39:27,460 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 19:39:27,470 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 19:39:27,472 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 19:39:27,473 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 19:39:27,473 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 19:39:27,474 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:28,680 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6685ba3d9/c52b697bebcd4c7fbe61e6ed22fdc3cb/FLAG80bbeab7b
[2025-03-16 19:39:29,007 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 19:39:29,008 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:29,025 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6685ba3d9/c52b697bebcd4c7fbe61e6ed22fdc3cb/FLAG80bbeab7b
[2025-03-16 19:39:29,038 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6685ba3d9/c52b697bebcd4c7fbe61e6ed22fdc3cb
[2025-03-16 19:39:29,041 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 19:39:29,042 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 19:39:29,043 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 19:39:29,043 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 19:39:29,046 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 19:39:29,047 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,048 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ae08c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29, skipping insertion in model container
[2025-03-16 19:39:29,048 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,088 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 19:39:29,293 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13490,13503]
[2025-03-16 19:39:29,337 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 19:39:29,355 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 19:39:29,417 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13490,13503]
[2025-03-16 19:39:29,447 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 19:39:29,461 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 19:39:29,461 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29 WrapperNode
[2025-03-16 19:39:29,462 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 19:39:29,463 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 19:39:29,463 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 19:39:29,463 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 19:39:29,468 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,480 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,528 INFO  L138                Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1415
[2025-03-16 19:39:29,528 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 19:39:29,528 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 19:39:29,528 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 19:39:29,528 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 19:39:29,535 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,536 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,545 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,572 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-16 19:39:29,572 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,572 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,598 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,606 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,612 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,618 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,629 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 19:39:29,631 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 19:39:29,631 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 19:39:29,631 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 19:39:29,632 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (1/1) ...
[2025-03-16 19:39:29,637 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 19:39:29,648 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 19:39:29,662 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-16 19:39:29,669 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-16 19:39:29,688 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 19:39:29,688 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 19:39:29,688 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 19:39:29,689 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 19:39:29,829 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 19:39:29,830 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 19:39:30,802 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc main_~node4__newmax~0#1;
[2025-03-16 19:39:30,803 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L702: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;
[2025-03-16 19:39:30,803 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L505: havoc main_~node2__newmax~0#1;
[2025-03-16 19:39:30,803 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1376: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;
[2025-03-16 19:39:30,803 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1211: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;
[2025-03-16 19:39:30,803 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1046: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;
[2025-03-16 19:39:30,803 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L881: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;
[2025-03-16 19:39:30,804 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc main_~node3__newmax~0#1;
[2025-03-16 19:39:30,804 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1;
[2025-03-16 19:39:30,920 INFO  L?                        ?]: Removed 111 outVars from TransFormulas that were not future-live.
[2025-03-16 19:39:30,921 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 19:39:30,945 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 19:39:30,945 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 19:39:30,945 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:30 BoogieIcfgContainer
[2025-03-16 19:39:30,945 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 19:39:30,947 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 19:39:30,947 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 19:39:30,951 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 19:39:30,951 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:39:29" (1/3) ...
[2025-03-16 19:39:30,952 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6847603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:30, skipping insertion in model container
[2025-03-16 19:39:30,952 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:29" (2/3) ...
[2025-03-16 19:39:30,953 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6847603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:30, skipping insertion in model container
[2025-03-16 19:39:30,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:30" (3/3) ...
[2025-03-16 19:39:30,955 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:30,969 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 19:39:30,972 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 337 locations, 1 initial locations, 0 loop locations, and 1 error locations.
[2025-03-16 19:39:31,027 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 19:39:31,037 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;@239c81d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 19:39:31,038 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 19:39:31,042 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 337 states, 335 states have (on average 1.782089552238806) internal successors, (597), 336 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:31,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-16 19:39:31,056 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:31,057 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:31,057 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:31,061 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:31,061 INFO  L85        PathProgramCache]: Analyzing trace with hash -844613813, now seen corresponding path program 1 times
[2025-03-16 19:39:31,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:31,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839332055]
[2025-03-16 19:39:31,066 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:31,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:31,157 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-16 19:39:31,325 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-16 19:39:31,325 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:31,325 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:31,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:31,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:31,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839332055]
[2025-03-16 19:39:31,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839332055] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:31,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:31,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:31,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704746122]
[2025-03-16 19:39:31,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:31,632 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:31,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:31,651 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:31,652 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:31,654 INFO  L87              Difference]: Start difference. First operand  has 337 states, 335 states have (on average 1.782089552238806) internal successors, (597), 336 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:31,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:31,778 INFO  L93              Difference]: Finished difference Result 639 states and 1099 transitions.
[2025-03-16 19:39:31,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:31,781 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105
[2025-03-16 19:39:31,781 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:31,789 INFO  L225             Difference]: With dead ends: 639
[2025-03-16 19:39:31,789 INFO  L226             Difference]: Without dead ends: 476
[2025-03-16 19:39:31,792 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:31,797 INFO  L435           NwaCegarLoop]: 591 mSDtfsCounter, 254 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:31,798 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1121 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:31,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 476 states.
[2025-03-16 19:39:31,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 473.
[2025-03-16 19:39:31,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 473 states, 472 states have (on average 1.6694915254237288) internal successors, (788), 472 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:31,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 788 transitions.
[2025-03-16 19:39:31,859 INFO  L78                 Accepts]: Start accepts. Automaton has 473 states and 788 transitions. Word has length 105
[2025-03-16 19:39:31,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:31,861 INFO  L471      AbstractCegarLoop]: Abstraction has 473 states and 788 transitions.
[2025-03-16 19:39:31,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:31,862 INFO  L276                IsEmpty]: Start isEmpty. Operand 473 states and 788 transitions.
[2025-03-16 19:39:31,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-03-16 19:39:31,868 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:31,869 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]
[2025-03-16 19:39:31,869 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 19:39:31,869 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:31,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:31,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -1568756360, now seen corresponding path program 1 times
[2025-03-16 19:39:31,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:31,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801049827]
[2025-03-16 19:39:31,870 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:31,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:31,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-03-16 19:39:31,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-03-16 19:39:31,962 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:31,962 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:32,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:32,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:32,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801049827]
[2025-03-16 19:39:32,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801049827] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:32,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:32,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:32,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795515535]
[2025-03-16 19:39:32,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:32,164 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:32,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:32,164 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:32,164 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:32,164 INFO  L87              Difference]: Start difference. First operand 473 states and 788 transitions. Second operand  has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:32,295 INFO  L93              Difference]: Finished difference Result 1039 states and 1728 transitions.
[2025-03-16 19:39:32,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:32,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108
[2025-03-16 19:39:32,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:32,301 INFO  L225             Difference]: With dead ends: 1039
[2025-03-16 19:39:32,301 INFO  L226             Difference]: Without dead ends: 746
[2025-03-16 19:39:32,302 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:32,302 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 229 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:32,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1083 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:32,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 746 states.
[2025-03-16 19:39:32,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 742.
[2025-03-16 19:39:32,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 742 states, 741 states have (on average 1.6639676113360324) internal successors, (1233), 741 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1233 transitions.
[2025-03-16 19:39:32,331 INFO  L78                 Accepts]: Start accepts. Automaton has 742 states and 1233 transitions. Word has length 108
[2025-03-16 19:39:32,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:32,331 INFO  L471      AbstractCegarLoop]: Abstraction has 742 states and 1233 transitions.
[2025-03-16 19:39:32,331 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 742 states and 1233 transitions.
[2025-03-16 19:39:32,334 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-16 19:39:32,334 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:32,334 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:32,334 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 19:39:32,335 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:32,335 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:32,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 154998432, now seen corresponding path program 1 times
[2025-03-16 19:39:32,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:32,335 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917572825]
[2025-03-16 19:39:32,335 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:32,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:32,365 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-16 19:39:32,398 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-16 19:39:32,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:32,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:32,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:32,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:32,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917572825]
[2025-03-16 19:39:32,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917572825] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:32,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:32,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:32,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930762135]
[2025-03-16 19:39:32,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:32,531 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:32,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:32,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:32,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:32,531 INFO  L87              Difference]: Start difference. First operand 742 states and 1233 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,576 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:32,577 INFO  L93              Difference]: Finished difference Result 1826 states and 3027 transitions.
[2025-03-16 19:39:32,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:32,578 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-03-16 19:39:32,578 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:32,583 INFO  L225             Difference]: With dead ends: 1826
[2025-03-16 19:39:32,583 INFO  L226             Difference]: Without dead ends: 1264
[2025-03-16 19:39:32,584 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:32,585 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:32,585 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1084 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:32,588 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1264 states.
[2025-03-16 19:39:32,617 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1258.
[2025-03-16 19:39:32,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1258 states, 1257 states have (on average 1.6555290373906126) internal successors, (2081), 1257 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 2081 transitions.
[2025-03-16 19:39:32,623 INFO  L78                 Accepts]: Start accepts. Automaton has 1258 states and 2081 transitions. Word has length 111
[2025-03-16 19:39:32,624 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:32,624 INFO  L471      AbstractCegarLoop]: Abstraction has 1258 states and 2081 transitions.
[2025-03-16 19:39:32,624 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,624 INFO  L276                IsEmpty]: Start isEmpty. Operand 1258 states and 2081 transitions.
[2025-03-16 19:39:32,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-03-16 19:39:32,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:32,626 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:32,626 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 19:39:32,626 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:32,627 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:32,627 INFO  L85        PathProgramCache]: Analyzing trace with hash -1671304851, now seen corresponding path program 1 times
[2025-03-16 19:39:32,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:32,627 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539271350]
[2025-03-16 19:39:32,627 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:32,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:32,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-03-16 19:39:32,676 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-03-16 19:39:32,677 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:32,677 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:32,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:32,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:32,804 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539271350]
[2025-03-16 19:39:32,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539271350] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:32,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:32,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:32,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738330582]
[2025-03-16 19:39:32,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:32,805 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:32,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:32,806 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:32,806 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:32,806 INFO  L87              Difference]: Start difference. First operand 1258 states and 2081 transitions. Second operand  has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:32,843 INFO  L93              Difference]: Finished difference Result 3334 states and 5499 transitions.
[2025-03-16 19:39:32,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:32,844 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114
[2025-03-16 19:39:32,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:32,853 INFO  L225             Difference]: With dead ends: 3334
[2025-03-16 19:39:32,853 INFO  L226             Difference]: Without dead ends: 2256
[2025-03-16 19:39:32,855 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:32,857 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 215 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:32,858 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1085 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:32,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2256 states.
[2025-03-16 19:39:32,895 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2246.
[2025-03-16 19:39:32,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2246 states, 2245 states have (on average 1.644988864142539) internal successors, (3693), 2245 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3693 transitions.
[2025-03-16 19:39:32,905 INFO  L78                 Accepts]: Start accepts. Automaton has 2246 states and 3693 transitions. Word has length 114
[2025-03-16 19:39:32,905 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:32,905 INFO  L471      AbstractCegarLoop]: Abstraction has 2246 states and 3693 transitions.
[2025-03-16 19:39:32,906 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:32,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 2246 states and 3693 transitions.
[2025-03-16 19:39:32,907 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-16 19:39:32,907 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:32,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]
[2025-03-16 19:39:32,907 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 19:39:32,907 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:32,908 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:32,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 684029685, now seen corresponding path program 1 times
[2025-03-16 19:39:32,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:32,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171020613]
[2025-03-16 19:39:32,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:32,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:32,934 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-16 19:39:32,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-16 19:39:32,956 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:32,956 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:33,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-16 19:39:33,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:33,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171020613]
[2025-03-16 19:39:33,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171020613] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:33,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:33,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:33,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983034328]
[2025-03-16 19:39:33,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:33,148 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:33,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:33,148 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:33,149 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:33,149 INFO  L87              Difference]: Start difference. First operand 2246 states and 3693 transitions. Second operand  has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:33,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:33,499 INFO  L93              Difference]: Finished difference Result 11826 states and 19557 transitions.
[2025-03-16 19:39:33,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-16 19:39:33,499 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117
[2025-03-16 19:39:33,500 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:33,528 INFO  L225             Difference]: With dead ends: 11826
[2025-03-16 19:39:33,529 INFO  L226             Difference]: Without dead ends: 9760
[2025-03-16 19:39:33,534 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-16 19:39:33,535 INFO  L435           NwaCegarLoop]: 565 mSDtfsCounter, 2227 mSDsluCounter, 4816 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 5381 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:33,535 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 5381 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 19:39:33,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9760 states.
[2025-03-16 19:39:33,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 4176.
[2025-03-16 19:39:33,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4176 states, 4175 states have (on average 1.6431137724550897) internal successors, (6860), 4175 states have internal predecessors, (6860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:33,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6860 transitions.
[2025-03-16 19:39:33,672 INFO  L78                 Accepts]: Start accepts. Automaton has 4176 states and 6860 transitions. Word has length 117
[2025-03-16 19:39:33,672 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:33,672 INFO  L471      AbstractCegarLoop]: Abstraction has 4176 states and 6860 transitions.
[2025-03-16 19:39:33,673 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:33,673 INFO  L276                IsEmpty]: Start isEmpty. Operand 4176 states and 6860 transitions.
[2025-03-16 19:39:33,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-03-16 19:39:33,676 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:33,676 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:33,676 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 19:39:33,676 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:33,679 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:33,679 INFO  L85        PathProgramCache]: Analyzing trace with hash -267948045, now seen corresponding path program 1 times
[2025-03-16 19:39:33,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:33,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210468592]
[2025-03-16 19:39:33,680 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:33,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:33,701 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-03-16 19:39:33,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-03-16 19:39:33,724 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:33,724 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:33,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:33,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:33,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210468592]
[2025-03-16 19:39:33,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210468592] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:33,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:33,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:33,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076974549]
[2025-03-16 19:39:33,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:33,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:33,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:33,839 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:33,839 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:33,839 INFO  L87              Difference]: Start difference. First operand 4176 states and 6860 transitions. Second operand  has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:33,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:33,946 INFO  L93              Difference]: Finished difference Result 12274 states and 20248 transitions.
[2025-03-16 19:39:33,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:33,947 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118
[2025-03-16 19:39:33,947 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:33,974 INFO  L225             Difference]: With dead ends: 12274
[2025-03-16 19:39:33,974 INFO  L226             Difference]: Without dead ends: 8278
[2025-03-16 19:39:33,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:33,983 INFO  L435           NwaCegarLoop]: 560 mSDtfsCounter, 752 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:33,983 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1867 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:33,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8278 states.
[2025-03-16 19:39:34,094 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 6210.
[2025-03-16 19:39:34,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6210 states, 6209 states have (on average 1.644870349492672) internal successors, (10213), 6209 states have internal predecessors, (10213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:34,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 10213 transitions.
[2025-03-16 19:39:34,126 INFO  L78                 Accepts]: Start accepts. Automaton has 6210 states and 10213 transitions. Word has length 118
[2025-03-16 19:39:34,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:34,126 INFO  L471      AbstractCegarLoop]: Abstraction has 6210 states and 10213 transitions.
[2025-03-16 19:39:34,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:34,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 6210 states and 10213 transitions.
[2025-03-16 19:39:34,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-03-16 19:39:34,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:34,129 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:34,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 19:39:34,130 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:34,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:34,131 INFO  L85        PathProgramCache]: Analyzing trace with hash 285424024, now seen corresponding path program 1 times
[2025-03-16 19:39:34,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:34,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601769502]
[2025-03-16 19:39:34,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:34,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:34,148 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-03-16 19:39:34,165 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-03-16 19:39:34,165 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:34,165 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:34,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:34,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:34,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601769502]
[2025-03-16 19:39:34,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601769502] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:34,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:34,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:34,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655943843]
[2025-03-16 19:39:34,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:34,294 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:34,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:34,294 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:34,294 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:34,294 INFO  L87              Difference]: Start difference. First operand 6210 states and 10213 transitions. Second operand  has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:34,411 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:34,412 INFO  L93              Difference]: Finished difference Result 18272 states and 30108 transitions.
[2025-03-16 19:39:34,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:34,412 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119
[2025-03-16 19:39:34,412 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:34,438 INFO  L225             Difference]: With dead ends: 18272
[2025-03-16 19:39:34,438 INFO  L226             Difference]: Without dead ends: 12242
[2025-03-16 19:39:34,451 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:34,451 INFO  L435           NwaCegarLoop]: 548 mSDtfsCounter, 752 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:34,452 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1857 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:34,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12242 states.
[2025-03-16 19:39:34,636 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12242 to 9202.
[2025-03-16 19:39:34,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9202 states, 9201 states have (on average 1.6427562221497662) internal successors, (15115), 9201 states have internal predecessors, (15115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:34,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9202 states to 9202 states and 15115 transitions.
[2025-03-16 19:39:34,688 INFO  L78                 Accepts]: Start accepts. Automaton has 9202 states and 15115 transitions. Word has length 119
[2025-03-16 19:39:34,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:34,688 INFO  L471      AbstractCegarLoop]: Abstraction has 9202 states and 15115 transitions.
[2025-03-16 19:39:34,688 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:34,688 INFO  L276                IsEmpty]: Start isEmpty. Operand 9202 states and 15115 transitions.
[2025-03-16 19:39:34,692 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-03-16 19:39:34,692 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:34,692 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:34,692 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 19:39:34,693 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:34,693 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:34,693 INFO  L85        PathProgramCache]: Analyzing trace with hash 259999606, now seen corresponding path program 1 times
[2025-03-16 19:39:34,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:34,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681992761]
[2025-03-16 19:39:34,693 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:34,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:34,710 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-03-16 19:39:34,728 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-03-16 19:39:34,728 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:34,728 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:34,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:34,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:34,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681992761]
[2025-03-16 19:39:34,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681992761] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:34,859 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:34,859 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:34,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705162750]
[2025-03-16 19:39:34,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:34,860 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:34,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:34,860 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:34,861 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:34,861 INFO  L87              Difference]: Start difference. First operand 9202 states and 15115 transitions. Second operand  has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:34,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:34,983 INFO  L93              Difference]: Finished difference Result 27096 states and 44596 transitions.
[2025-03-16 19:39:34,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:34,983 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120
[2025-03-16 19:39:34,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:35,021 INFO  L225             Difference]: With dead ends: 27096
[2025-03-16 19:39:35,021 INFO  L226             Difference]: Without dead ends: 18074
[2025-03-16 19:39:35,038 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:35,039 INFO  L435           NwaCegarLoop]: 547 mSDtfsCounter, 750 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:35,039 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1787 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:35,058 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18074 states.
[2025-03-16 19:39:35,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18074 to 13604.
[2025-03-16 19:39:35,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13604 states, 13603 states have (on average 1.6407410130118356) internal successors, (22319), 13603 states have internal predecessors, (22319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:35,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13604 states to 13604 states and 22319 transitions.
[2025-03-16 19:39:35,323 INFO  L78                 Accepts]: Start accepts. Automaton has 13604 states and 22319 transitions. Word has length 120
[2025-03-16 19:39:35,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:35,323 INFO  L471      AbstractCegarLoop]: Abstraction has 13604 states and 22319 transitions.
[2025-03-16 19:39:35,324 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:35,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 13604 states and 22319 transitions.
[2025-03-16 19:39:35,366 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-16 19:39:35,368 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:35,368 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:35,368 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 19:39:35,368 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:35,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:35,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -802788202, now seen corresponding path program 1 times
[2025-03-16 19:39:35,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:35,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983366348]
[2025-03-16 19:39:35,369 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:35,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:35,387 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-16 19:39:35,404 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-16 19:39:35,404 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:35,404 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:35,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:35,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:35,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983366348]
[2025-03-16 19:39:35,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983366348] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:35,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:35,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:35,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793206861]
[2025-03-16 19:39:35,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:35,458 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:35,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:35,458 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:35,459 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:35,459 INFO  L87              Difference]: Start difference. First operand 13604 states and 22319 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:35,536 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:35,536 INFO  L93              Difference]: Finished difference Result 30315 states and 49925 transitions.
[2025-03-16 19:39:35,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:35,537 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2025-03-16 19:39:35,537 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:35,573 INFO  L225             Difference]: With dead ends: 30315
[2025-03-16 19:39:35,573 INFO  L226             Difference]: Without dead ends: 20888
[2025-03-16 19:39:35,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-16 19:39:35,591 INFO  L435           NwaCegarLoop]: 751 mSDtfsCounter, 235 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:35,592 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1264 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:35,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20888 states.
[2025-03-16 19:39:35,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20888 to 20886.
[2025-03-16 19:39:35,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20886 states, 20885 states have (on average 1.6398850849892268) internal successors, (34249), 20885 states have internal predecessors, (34249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:35,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 34249 transitions.
[2025-03-16 19:39:35,884 INFO  L78                 Accepts]: Start accepts. Automaton has 20886 states and 34249 transitions. Word has length 121
[2025-03-16 19:39:35,884 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:35,884 INFO  L471      AbstractCegarLoop]: Abstraction has 20886 states and 34249 transitions.
[2025-03-16 19:39:35,884 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:35,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 20886 states and 34249 transitions.
[2025-03-16 19:39:35,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-16 19:39:35,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:35,886 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:35,886 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 19:39:35,886 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:35,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:35,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 1263279540, now seen corresponding path program 1 times
[2025-03-16 19:39:35,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:35,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460784563]
[2025-03-16 19:39:35,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:35,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:35,903 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-16 19:39:35,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-16 19:39:35,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:35,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:35,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:35,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:35,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460784563]
[2025-03-16 19:39:35,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460784563] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:35,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:35,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:35,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267077095]
[2025-03-16 19:39:35,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:35,974 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:35,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:35,975 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:35,975 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:35,975 INFO  L87              Difference]: Start difference. First operand 20886 states and 34249 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:36,184 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:36,184 INFO  L93              Difference]: Finished difference Result 46151 states and 75749 transitions.
[2025-03-16 19:39:36,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:36,185 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2025-03-16 19:39:36,185 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:36,232 INFO  L225             Difference]: With dead ends: 46151
[2025-03-16 19:39:36,233 INFO  L226             Difference]: Without dead ends: 31732
[2025-03-16 19:39:36,244 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:36,245 INFO  L435           NwaCegarLoop]: 725 mSDtfsCounter, 228 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:36,245 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1239 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:36,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31732 states.
[2025-03-16 19:39:36,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31732 to 31730.
[2025-03-16 19:39:36,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31730 states, 31729 states have (on average 1.6349711620284282) internal successors, (51876), 31729 states have internal predecessors, (51876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:36,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31730 states to 31730 states and 51876 transitions.
[2025-03-16 19:39:36,646 INFO  L78                 Accepts]: Start accepts. Automaton has 31730 states and 51876 transitions. Word has length 121
[2025-03-16 19:39:36,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:36,646 INFO  L471      AbstractCegarLoop]: Abstraction has 31730 states and 51876 transitions.
[2025-03-16 19:39:36,647 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:36,647 INFO  L276                IsEmpty]: Start isEmpty. Operand 31730 states and 51876 transitions.
[2025-03-16 19:39:36,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-16 19:39:36,648 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:36,648 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:36,648 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 19:39:36,649 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:36,649 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:36,650 INFO  L85        PathProgramCache]: Analyzing trace with hash 1812148212, now seen corresponding path program 1 times
[2025-03-16 19:39:36,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:36,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633325146]
[2025-03-16 19:39:36,650 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:36,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:36,673 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-16 19:39:36,695 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-16 19:39:36,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:36,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:36,767 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:36,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:36,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633325146]
[2025-03-16 19:39:36,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633325146] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:36,768 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:36,768 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:36,768 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260891127]
[2025-03-16 19:39:36,768 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:36,768 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:36,768 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:36,769 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:36,769 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:36,769 INFO  L87              Difference]: Start difference. First operand 31730 states and 51876 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:36,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:36,958 INFO  L93              Difference]: Finished difference Result 62042 states and 101563 transitions.
[2025-03-16 19:39:36,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:36,959 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2025-03-16 19:39:36,959 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:37,055 INFO  L225             Difference]: With dead ends: 62042
[2025-03-16 19:39:37,055 INFO  L226             Difference]: Without dead ends: 44516
[2025-03-16 19:39:37,087 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:37,089 INFO  L435           NwaCegarLoop]: 637 mSDtfsCounter, 214 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:37,089 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:37,121 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44516 states.
[2025-03-16 19:39:37,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44516 to 44514.
[2025-03-16 19:39:37,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44514 states, 44513 states have (on average 1.6301529890144453) internal successors, (72563), 44513 states have internal predecessors, (72563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:37,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44514 states to 44514 states and 72563 transitions.
[2025-03-16 19:39:37,849 INFO  L78                 Accepts]: Start accepts. Automaton has 44514 states and 72563 transitions. Word has length 121
[2025-03-16 19:39:37,850 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:37,851 INFO  L471      AbstractCegarLoop]: Abstraction has 44514 states and 72563 transitions.
[2025-03-16 19:39:37,851 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:37,851 INFO  L276                IsEmpty]: Start isEmpty. Operand 44514 states and 72563 transitions.
[2025-03-16 19:39:37,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-16 19:39:37,852 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:37,852 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:37,852 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 19:39:37,852 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:37,852 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:37,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -528246725, now seen corresponding path program 1 times
[2025-03-16 19:39:37,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:37,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452174345]
[2025-03-16 19:39:37,853 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:37,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:37,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-16 19:39:37,894 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-16 19:39:37,895 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:37,895 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:38,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:38,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:38,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452174345]
[2025-03-16 19:39:38,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452174345] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:38,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:38,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:38,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488167326]
[2025-03-16 19:39:38,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:38,005 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:38,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:38,005 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:38,005 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:38,006 INFO  L87              Difference]: Start difference. First operand 44514 states and 72563 transitions. Second operand  has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:38,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:38,607 INFO  L93              Difference]: Finished difference Result 142140 states and 232059 transitions.
[2025-03-16 19:39:38,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:38,607 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2025-03-16 19:39:38,608 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:38,786 INFO  L225             Difference]: With dead ends: 142140
[2025-03-16 19:39:38,786 INFO  L226             Difference]: Without dead ends: 97894
[2025-03-16 19:39:38,830 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:38,831 INFO  L435           NwaCegarLoop]: 548 mSDtfsCounter, 748 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:38,831 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1861 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:38,901 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97894 states.
[2025-03-16 19:39:40,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97894 to 71070.
[2025-03-16 19:39:40,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71070 states, 71069 states have (on average 1.6263771827379025) internal successors, (115585), 71069 states have internal predecessors, (115585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:40,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71070 states to 71070 states and 115585 transitions.
[2025-03-16 19:39:40,421 INFO  L78                 Accepts]: Start accepts. Automaton has 71070 states and 115585 transitions. Word has length 121
[2025-03-16 19:39:40,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:40,421 INFO  L471      AbstractCegarLoop]: Abstraction has 71070 states and 115585 transitions.
[2025-03-16 19:39:40,422 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:40,422 INFO  L276                IsEmpty]: Start isEmpty. Operand 71070 states and 115585 transitions.
[2025-03-16 19:39:40,423 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-16 19:39:40,423 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:40,423 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:40,423 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 19:39:40,424 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:40,424 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:40,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -1862118826, now seen corresponding path program 1 times
[2025-03-16 19:39:40,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:40,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043256050]
[2025-03-16 19:39:40,425 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:40,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:40,444 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-16 19:39:40,460 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-16 19:39:40,461 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:40,461 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:40,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:40,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:40,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043256050]
[2025-03-16 19:39:40,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043256050] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:40,515 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:40,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:40,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703034309]
[2025-03-16 19:39:40,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:40,515 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:40,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:40,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:40,516 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:40,516 INFO  L87              Difference]: Start difference. First operand 71070 states and 115585 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:40,951 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:40,952 INFO  L93              Difference]: Finished difference Result 155591 states and 253229 transitions.
[2025-03-16 19:39:40,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:40,952 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2025-03-16 19:39:40,952 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:41,129 INFO  L225             Difference]: With dead ends: 155591
[2025-03-16 19:39:41,129 INFO  L226             Difference]: Without dead ends: 105854
[2025-03-16 19:39:41,196 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:41,198 INFO  L435           NwaCegarLoop]: 691 mSDtfsCounter, 221 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:41,198 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1206 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:41,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105854 states.
[2025-03-16 19:39:42,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105854 to 105852.
[2025-03-16 19:39:42,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105852 states, 105851 states have (on average 1.6188415792009523) internal successors, (171356), 105851 states have internal predecessors, (171356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:42,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105852 states to 105852 states and 171356 transitions.
[2025-03-16 19:39:42,715 INFO  L78                 Accepts]: Start accepts. Automaton has 105852 states and 171356 transitions. Word has length 121
[2025-03-16 19:39:42,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:42,715 INFO  L471      AbstractCegarLoop]: Abstraction has 105852 states and 171356 transitions.
[2025-03-16 19:39:42,715 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:42,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 105852 states and 171356 transitions.
[2025-03-16 19:39:42,716 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-16 19:39:42,716 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:42,716 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:42,716 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 19:39:42,716 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:42,717 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:42,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -787478723, now seen corresponding path program 1 times
[2025-03-16 19:39:42,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:42,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543328780]
[2025-03-16 19:39:42,717 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:42,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:42,735 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-16 19:39:42,749 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-16 19:39:42,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:42,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:43,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:43,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:43,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543328780]
[2025-03-16 19:39:43,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543328780] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:43,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:43,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:43,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944817291]
[2025-03-16 19:39:43,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:43,337 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:43,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:43,337 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:43,337 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:43,338 INFO  L87              Difference]: Start difference. First operand 105852 states and 171356 transitions. Second operand  has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:44,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:44,006 INFO  L93              Difference]: Finished difference Result 211458 states and 342309 transitions.
[2025-03-16 19:39:44,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:39:44,006 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123
[2025-03-16 19:39:44,007 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:44,177 INFO  L225             Difference]: With dead ends: 211458
[2025-03-16 19:39:44,177 INFO  L226             Difference]: Without dead ends: 105854
[2025-03-16 19:39:44,252 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2025-03-16 19:39:44,252 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 437 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:44,252 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2125 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:44,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105854 states.
[2025-03-16 19:39:45,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105854 to 105852.
[2025-03-16 19:39:45,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105852 states, 105851 states have (on average 1.6129370530273686) internal successors, (170731), 105851 states have internal predecessors, (170731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:45,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105852 states to 105852 states and 170731 transitions.
[2025-03-16 19:39:45,927 INFO  L78                 Accepts]: Start accepts. Automaton has 105852 states and 170731 transitions. Word has length 123
[2025-03-16 19:39:45,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:45,927 INFO  L471      AbstractCegarLoop]: Abstraction has 105852 states and 170731 transitions.
[2025-03-16 19:39:45,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:45,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 105852 states and 170731 transitions.
[2025-03-16 19:39:45,928 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-16 19:39:45,928 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:45,928 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:45,928 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 19:39:45,928 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:45,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:45,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 720263520, now seen corresponding path program 1 times
[2025-03-16 19:39:45,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:45,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525134634]
[2025-03-16 19:39:45,929 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:45,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:45,946 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-16 19:39:45,963 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-16 19:39:45,964 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:45,964 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:46,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:46,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:46,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525134634]
[2025-03-16 19:39:46,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525134634] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:46,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:46,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:46,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120926038]
[2025-03-16 19:39:46,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:46,245 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:46,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:46,250 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:46,250 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:46,250 INFO  L87              Difference]: Start difference. First operand 105852 states and 170731 transitions. Second operand  has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:47,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:47,255 INFO  L93              Difference]: Finished difference Result 309456 states and 499569 transitions.
[2025-03-16 19:39:47,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:39:47,255 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-16 19:39:47,255 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:47,607 INFO  L225             Difference]: With dead ends: 309456
[2025-03-16 19:39:47,607 INFO  L226             Difference]: Without dead ends: 203852
[2025-03-16 19:39:47,700 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2025-03-16 19:39:47,701 INFO  L435           NwaCegarLoop]: 547 mSDtfsCounter, 863 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:47,701 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2134 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:47,831 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203852 states.
[2025-03-16 19:39:49,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203852 to 203850.
[2025-03-16 19:39:50,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203850 states, 203849 states have (on average 1.6052273987117915) internal successors, (327224), 203849 states have internal predecessors, (327224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:50,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203850 states to 203850 states and 327224 transitions.
[2025-03-16 19:39:50,908 INFO  L78                 Accepts]: Start accepts. Automaton has 203850 states and 327224 transitions. Word has length 126
[2025-03-16 19:39:50,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:50,908 INFO  L471      AbstractCegarLoop]: Abstraction has 203850 states and 327224 transitions.
[2025-03-16 19:39:50,908 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:50,908 INFO  L276                IsEmpty]: Start isEmpty. Operand 203850 states and 327224 transitions.
[2025-03-16 19:39:50,909 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-03-16 19:39:50,909 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:50,909 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]
[2025-03-16 19:39:50,909 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 19:39:50,909 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:50,910 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:50,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 854287946, now seen corresponding path program 1 times
[2025-03-16 19:39:50,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:50,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858965900]
[2025-03-16 19:39:50,910 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:50,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:50,948 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-03-16 19:39:51,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-03-16 19:39:51,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:51,084 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:51,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:51,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:51,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858965900]
[2025-03-16 19:39:51,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858965900] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:51,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:51,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 19:39:51,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592842581]
[2025-03-16 19:39:51,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:51,505 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 19:39:51,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:51,506 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 19:39:51,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:51,506 INFO  L87              Difference]: Start difference. First operand 203850 states and 327224 transitions. Second operand  has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:52,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:52,319 INFO  L93              Difference]: Finished difference Result 207724 states and 333033 transitions.
[2025-03-16 19:39:52,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 19:39:52,320 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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 127
[2025-03-16 19:39:52,320 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:52,767 INFO  L225             Difference]: With dead ends: 207724
[2025-03-16 19:39:52,768 INFO  L226             Difference]: Without dead ends: 207722
[2025-03-16 19:39:52,851 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:39:52,851 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:52,851 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2207 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:53,018 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207722 states.
[2025-03-16 19:39:55,378 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207722 to 207722.
[2025-03-16 19:39:55,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 207722 states, 207721 states have (on average 1.593815743232509) internal successors, (331069), 207721 states have internal predecessors, (331069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 207722 states to 207722 states and 331069 transitions.
[2025-03-16 19:39:56,024 INFO  L78                 Accepts]: Start accepts. Automaton has 207722 states and 331069 transitions. Word has length 127
[2025-03-16 19:39:56,024 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:56,024 INFO  L471      AbstractCegarLoop]: Abstraction has 207722 states and 331069 transitions.
[2025-03-16 19:39:56,024 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,024 INFO  L276                IsEmpty]: Start isEmpty. Operand 207722 states and 331069 transitions.
[2025-03-16 19:39:56,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2025-03-16 19:39:56,027 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:56,028 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:56,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 19:39:56,028 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:56,028 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:56,028 INFO  L85        PathProgramCache]: Analyzing trace with hash -783735815, now seen corresponding path program 1 times
[2025-03-16 19:39:56,028 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:56,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952663215]
[2025-03-16 19:39:56,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:56,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:56,046 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-03-16 19:39:56,067 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-03-16 19:39:56,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:56,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:56,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-16 19:39:56,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:56,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952663215]
[2025-03-16 19:39:56,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952663215] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:56,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:56,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:56,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799753645]
[2025-03-16 19:39:56,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:56,319 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:56,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:56,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:56,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:56,321 INFO  L87              Difference]: Start difference. First operand 207722 states and 331069 transitions. Second operand  has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 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-16 19:39:58,474 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:58,475 INFO  L93              Difference]: Finished difference Result 566794 states and 905930 transitions.
[2025-03-16 19:39:58,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:39:58,475 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 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 163
[2025-03-16 19:39:58,475 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:59,981 INFO  L225             Difference]: With dead ends: 566794
[2025-03-16 19:39:59,981 INFO  L226             Difference]: Without dead ends: 474392
[2025-03-16 19:40:00,086 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2025-03-16 19:40:00,086 INFO  L435           NwaCegarLoop]: 803 mSDtfsCounter, 1691 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:00,086 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 3155 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:00,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 474392 states.
[2025-03-16 19:40:04,368 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 474392 to 333988.
[2025-03-16 19:40:04,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 333988 states, 333987 states have (on average 1.5922505965801064) internal successors, (531791), 333987 states have internal predecessors, (531791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:05,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 333988 states to 333988 states and 531791 transitions.
[2025-03-16 19:40:05,805 INFO  L78                 Accepts]: Start accepts. Automaton has 333988 states and 531791 transitions. Word has length 163
[2025-03-16 19:40:05,805 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:05,805 INFO  L471      AbstractCegarLoop]: Abstraction has 333988 states and 531791 transitions.
[2025-03-16 19:40:05,806 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 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-16 19:40:05,806 INFO  L276                IsEmpty]: Start isEmpty. Operand 333988 states and 531791 transitions.
[2025-03-16 19:40:05,809 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2025-03-16 19:40:05,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:05,809 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:05,809 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 19:40:05,809 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:05,810 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:05,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 1282331927, now seen corresponding path program 1 times
[2025-03-16 19:40:05,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:05,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538656448]
[2025-03-16 19:40:05,814 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:05,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:05,850 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-03-16 19:40:05,869 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-03-16 19:40:05,869 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:05,869 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:06,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-16 19:40:06,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:06,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538656448]
[2025-03-16 19:40:06,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538656448] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:06,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:06,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:40:06,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480213505]
[2025-03-16 19:40:06,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:06,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:40:06,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:06,046 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:40:06,046 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:40:06,046 INFO  L87              Difference]: Start difference. First operand 333988 states and 531791 transitions. Second operand  has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:08,216 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:08,216 INFO  L93              Difference]: Finished difference Result 637740 states and 1019446 transitions.
[2025-03-16 19:40:08,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:40:08,217 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163
[2025-03-16 19:40:08,217 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:09,251 INFO  L225             Difference]: With dead ends: 637740
[2025-03-16 19:40:09,252 INFO  L226             Difference]: Without dead ends: 546488
[2025-03-16 19:40:09,390 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2025-03-16 19:40:09,390 INFO  L435           NwaCegarLoop]: 807 mSDtfsCounter, 1680 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:09,391 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 3366 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:09,784 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 546488 states.